%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT152-1 : TPTP v8.1.0. Released v3.1.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 : n020.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:49:11 EDT 2022 % Result : Unsatisfiable 1.14s 0.51s % Output : CNFRefutation 1.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT152-1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 30 08:21:16 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 10 Number of unprocessed: 10 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 10 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 10 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 0 extension rule candidate clauses % 0.13/0.38 # 10 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 15 tableaux to operate on % 1.14/0.51 # There were 1 total branch saturation attempts. % 1.14/0.51 # There were 0 of these attempts blocked. % 1.14/0.51 # There were 0 deferred branch saturation attempts. % 1.14/0.51 # There were 0 free duplicated saturations. % 1.14/0.51 # There were 1 total successful branch saturations. % 1.14/0.51 # There were 0 successful branch saturations in interreduction. % 1.14/0.51 # There were 0 successful branch saturations on the branch. % 1.14/0.51 # There were 1 successful branch saturations after the branch. % 1.14/0.51 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.14/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.14/0.51 # Begin clausification derivation % 1.14/0.51 % 1.14/0.51 # End clausification derivation % 1.14/0.51 # Begin listing active clauses obtained from FOF to CNF conversion % 1.14/0.51 cnf(i_0_11, plain, (meet(X1,X1)=X1)). % 1.14/0.51 cnf(i_0_12, plain, (join(X1,X1)=X1)). % 1.14/0.51 cnf(i_0_15, plain, (meet(X1,X2)=meet(X2,X1))). % 1.14/0.51 cnf(i_0_16, plain, (join(X1,X2)=join(X2,X1))). % 1.14/0.51 cnf(i_0_13, plain, (meet(X1,join(X1,X2))=X1)). % 1.14/0.51 cnf(i_0_14, plain, (join(X1,meet(X1,X2))=X1)). % 1.14/0.51 cnf(i_0_17, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 1.14/0.51 cnf(i_0_18, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 1.14/0.51 cnf(i_0_20, negated_conjecture, (meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b))))!=meet(a,join(b,meet(a,c))))). % 1.14/0.51 cnf(i_0_19, plain, (meet(X1,join(X2,meet(X3,join(X4,meet(X3,join(X1,X2))))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))). % 1.14/0.51 cnf(i_0_22, plain, (X5=X5)). % 1.14/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.14/0.51 # Begin printing tableau % 1.14/0.51 # Found 6 steps % 1.14/0.51 cnf(i_0_11, plain, (meet(X5,X5)=X5), inference(start_rule)). % 1.14/0.51 cnf(i_0_28, plain, (meet(X5,X5)=X5), inference(extension_rule, [i_0_27])). % 1.14/0.51 cnf(i_0_50, plain, (meet(X3,X3)!=X3), inference(closure_rule, [i_0_11])). % 1.14/0.51 cnf(i_0_49, plain, (join(meet(X3,X3),meet(X5,X5))=join(X3,X5)), inference(extension_rule, [i_0_25])). % 1.14/0.51 cnf(i_0_58, plain, (join(X3,X5)!=meet(join(X3,X5),join(X3,X5))), inference(closure_rule, [i_0_11])). % 1.14/0.51 cnf(i_0_56, plain, (join(meet(X3,X3),meet(X5,X5))=meet(join(X3,X5),join(X3,X5))), inference(etableau_closure_rule, [i_0_56, ...])). % 1.14/0.51 # End printing tableau % 1.14/0.51 # SZS output end % 1.14/0.51 # Branches closed with saturation will be marked with an "s" % 1.14/0.52 # Child (17105) has found a proof. % 1.14/0.52 % 1.14/0.52 # Proof search is over... % 1.14/0.52 # Freeing feature tree %------------------------------------------------------------------------------