%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT010-1 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n007.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sun Jul 17 04:48:27 EDT 2022 % Result : Unsatisfiable 30.82s 4.28s % Output : CNFRefutation 30.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT010-1 : TPTP v8.1.0. Released v2.2.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.33 % CPULimit : 300 % 0.19/0.33 % WCLimit : 600 % 0.19/0.33 % DateTime : Thu Jun 30 01:00:38 EDT 2022 % 0.19/0.33 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.19/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.19/0.38 # % 0.19/0.38 # Number of axioms: 12 Number of unprocessed: 12 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 12 beginning clauses after preprocessing and clausification % 0.19/0.38 # Creating start rules for all 1 conjectures. % 0.19/0.38 # There are 1 start rule candidates: % 0.19/0.38 # Found 12 unit axioms. % 0.19/0.38 # 1 start rule tableaux created. % 0.19/0.38 # 0 extension rule candidate clauses % 0.19/0.38 # 12 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.38 # Creating equality axioms % 0.19/0.38 # Ran out of tableaux, making start rules for all clauses % 0.19/0.38 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.19/0.38 # We now have 17 tableaux to operate on % 30.82/4.28 # There were 1 total branch saturation attempts. % 30.82/4.28 # There were 0 of these attempts blocked. % 30.82/4.28 # There were 0 deferred branch saturation attempts. % 30.82/4.28 # There were 0 free duplicated saturations. % 30.82/4.28 # There were 1 total successful branch saturations. % 30.82/4.28 # There were 0 successful branch saturations in interreduction. % 30.82/4.28 # There were 0 successful branch saturations on the branch. % 30.82/4.28 # There were 1 successful branch saturations after the branch. % 30.82/4.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 30.82/4.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 30.82/4.28 # Begin clausification derivation % 30.82/4.28 % 30.82/4.28 # End clausification derivation % 30.82/4.28 # Begin listing active clauses obtained from FOF to CNF conversion % 30.82/4.28 cnf(i_0_13, plain, (meet(X1,X1)=X1)). % 30.82/4.28 cnf(i_0_14, plain, (join(X1,X1)=X1)). % 30.82/4.28 cnf(i_0_17, plain, (meet(X1,X2)=meet(X2,X1))). % 30.82/4.28 cnf(i_0_18, plain, (join(X1,X2)=join(X2,X1))). % 30.82/4.28 cnf(i_0_15, plain, (meet(X1,join(X1,X2))=X1)). % 30.82/4.28 cnf(i_0_16, plain, (join(X1,meet(X1,X2))=X1)). % 30.82/4.28 cnf(i_0_19, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 30.82/4.28 cnf(i_0_20, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 30.82/4.28 cnf(i_0_23, hypothesis, (join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3)))=meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))))). % 30.82/4.28 cnf(i_0_21, hypothesis, (join(meet(X1,join(X2,meet(X1,X3))),meet(X1,join(meet(X1,X2),meet(X3,X4))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))). % 30.82/4.28 cnf(i_0_22, hypothesis, (meet(join(X1,meet(X2,join(X1,X3))),join(X1,meet(join(X1,X2),join(X3,X4))))=join(X1,meet(X2,join(X3,meet(X1,X4)))))). % 30.82/4.28 cnf(i_0_24, negated_conjecture, (meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d))))!=meet(a,meet(join(b,c),join(b,d))))). % 30.82/4.28 cnf(i_0_26, plain, (X5=X5)). % 30.82/4.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 30.82/4.28 # Begin printing tableau % 30.82/4.28 # Found 6 steps % 30.82/4.28 cnf(i_0_13, plain, (meet(X4,X4)=X4), inference(start_rule)). % 30.82/4.28 cnf(i_0_32, plain, (meet(X4,X4)=X4), inference(extension_rule, [i_0_30])). % 30.82/4.28 cnf(i_0_53, plain, (meet(X4,X4)!=X4), inference(closure_rule, [i_0_13])). % 30.82/4.28 cnf(i_0_52, plain, (meet(meet(X4,X4),meet(X4,X4))=meet(X4,X4)), inference(extension_rule, [i_0_29])). % 30.82/4.28 cnf(i_0_64, plain, (meet(X4,X4)!=X4), inference(closure_rule, [i_0_13])). % 30.82/4.28 cnf(i_0_62, plain, (meet(meet(X4,X4),meet(X4,X4))=X4), inference(etableau_closure_rule, [i_0_62, ...])). % 30.82/4.28 # End printing tableau % 30.82/4.28 # SZS output end % 30.82/4.28 # Branches closed with saturation will be marked with an "s" % 30.82/4.29 # Child (30319) has found a proof. % 30.82/4.29 % 30.82/4.29 # Proof search is over... % 30.82/4.29 # Freeing feature tree %------------------------------------------------------------------------------