%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT013-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 : n014.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:28 EDT 2022 % Result : Unsatisfiable 10.64s 1.69s % Output : CNFRefutation 10.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT013-1 : TPTP v8.1.0. Released v2.2.0. % 0.12/0.13 % 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 : n014.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.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 29 01:36:27 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.18/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Number of axioms: 5 Number of unprocessed: 5 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 5 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 5 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 5 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 10 tableaux to operate on % 10.64/1.69 # There were 1 total branch saturation attempts. % 10.64/1.69 # There were 0 of these attempts blocked. % 10.64/1.69 # There were 0 deferred branch saturation attempts. % 10.64/1.69 # There were 0 free duplicated saturations. % 10.64/1.69 # There were 1 total successful branch saturations. % 10.64/1.69 # There were 0 successful branch saturations in interreduction. % 10.64/1.69 # There were 0 successful branch saturations on the branch. % 10.64/1.69 # There were 1 successful branch saturations after the branch. % 10.64/1.69 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # Begin clausification derivation % 10.64/1.69 % 10.64/1.69 # End clausification derivation % 10.64/1.69 # Begin listing active clauses obtained from FOF to CNF conversion % 10.64/1.69 cnf(i_0_7, plain, (meet(X1,join(X2,join(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_6, plain, (join(X1,meet(X2,meet(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_10, negated_conjecture, (meet(meet(a,b),c)!=meet(a,meet(b,c)))). % 10.64/1.69 cnf(i_0_9, plain, (meet(meet(join(X1,X2),join(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_8, plain, (join(join(meet(X1,X2),meet(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_12, plain, (X4=X4)). % 10.64/1.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.64/1.69 # Begin printing tableau % 10.64/1.69 # Found 6 steps % 10.64/1.69 cnf(i_0_7, plain, (meet(X5,join(X9,join(X5,X8)))=X5), inference(start_rule)). % 10.64/1.69 cnf(i_0_18, plain, (meet(X5,join(X9,join(X5,X8)))=X5), inference(extension_rule, [i_0_17])). % 10.64/1.69 cnf(i_0_36, plain, (meet(X7,join(X2,join(X7,X3)))!=X7), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_34, plain, (join(meet(X5,join(X9,join(X5,X8))),meet(X7,join(X2,join(X7,X3))))=join(X5,X7)), inference(extension_rule, [i_0_15])). % 10.64/1.69 cnf(i_0_43, plain, (join(X5,X7)!=meet(join(X5,X7),join(X2,join(join(X5,X7),X3)))), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_41, plain, (join(meet(X5,join(X9,join(X5,X8))),meet(X7,join(X2,join(X7,X3))))=meet(join(X5,X7),join(X2,join(join(X5,X7),X3)))), inference(etableau_closure_rule, [i_0_41, ...])). % 10.64/1.69 # End printing tableau % 10.64/1.69 # SZS output end % 10.64/1.69 # Branches closed with saturation will be marked with an "s" % 10.64/1.69 # There were 1 total branch saturation attempts. % 10.64/1.69 # There were 0 of these attempts blocked. % 10.64/1.69 # There were 0 deferred branch saturation attempts. % 10.64/1.69 # There were 0 free duplicated saturations. % 10.64/1.69 # There were 1 total successful branch saturations. % 10.64/1.69 # There were 0 successful branch saturations in interreduction. % 10.64/1.69 # There were 0 successful branch saturations on the branch. % 10.64/1.69 # There were 1 successful branch saturations after the branch. % 10.64/1.69 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # Begin clausification derivation % 10.64/1.69 % 10.64/1.69 # End clausification derivation % 10.64/1.69 # Begin listing active clauses obtained from FOF to CNF conversion % 10.64/1.69 cnf(i_0_7, plain, (meet(X1,join(X2,join(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_6, plain, (join(X1,meet(X2,meet(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_10, negated_conjecture, (meet(meet(a,b),c)!=meet(a,meet(b,c)))). % 10.64/1.69 cnf(i_0_9, plain, (meet(meet(join(X1,X2),join(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_8, plain, (join(join(meet(X1,X2),meet(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_12, plain, (X4=X4)). % 10.64/1.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.64/1.69 # Begin printing tableau % 10.64/1.69 # Found 6 steps % 10.64/1.69 cnf(i_0_7, plain, (meet(X8,join(X13,join(X8,X12)))=X8), inference(start_rule)). % 10.64/1.69 cnf(i_0_18, plain, (meet(X8,join(X13,join(X8,X12)))=X8), inference(extension_rule, [i_0_16])). % 10.64/1.69 cnf(i_0_33, plain, (meet(join(X2,join(X8,X3)),join(X2,join(join(X2,join(X8,X3)),X3)))!=join(X2,join(X8,X3))), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_31, plain, (meet(meet(X8,join(X13,join(X8,X12))),meet(join(X2,join(X8,X3)),join(X2,join(join(X2,join(X8,X3)),X3))))=meet(X8,join(X2,join(X8,X3)))), inference(extension_rule, [i_0_15])). % 10.64/1.69 cnf(i_0_43, plain, (meet(X8,join(X2,join(X8,X3)))!=X8), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_41, plain, (meet(meet(X8,join(X13,join(X8,X12))),meet(join(X2,join(X8,X3)),join(X2,join(join(X2,join(X8,X3)),X3))))=X8), inference(etableau_closure_rule, [i_0_41, ...])). % 10.64/1.69 # End printing tableau % 10.64/1.69 # SZS output end % 10.64/1.69 # Branches closed with saturation will be marked with an "s" % 10.64/1.69 # There were 1 total branch saturation attempts. % 10.64/1.69 # There were 0 of these attempts blocked. % 10.64/1.69 # There were 0 deferred branch saturation attempts. % 10.64/1.69 # There were 0 free duplicated saturations. % 10.64/1.69 # There were 1 total successful branch saturations. % 10.64/1.69 # There were 0 successful branch saturations in interreduction. % 10.64/1.69 # There were 0 successful branch saturations on the branch. % 10.64/1.69 # There were 1 successful branch saturations after the branch. % 10.64/1.69 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.64/1.69 # Begin clausification derivation % 10.64/1.69 % 10.64/1.69 # End clausification derivation % 10.64/1.69 # Begin listing active clauses obtained from FOF to CNF conversion % 10.64/1.69 cnf(i_0_7, plain, (meet(X1,join(X2,join(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_6, plain, (join(X1,meet(X2,meet(X1,X3)))=X1)). % 10.64/1.69 cnf(i_0_10, negated_conjecture, (meet(meet(a,b),c)!=meet(a,meet(b,c)))). % 10.64/1.69 cnf(i_0_9, plain, (meet(meet(join(X1,X2),join(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_8, plain, (join(join(meet(X1,X2),meet(X2,X3)),X2)=X2)). % 10.64/1.69 cnf(i_0_12, plain, (X4=X4)). % 10.64/1.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.64/1.69 # Begin printing tableau % 10.64/1.69 # Found 6 steps % 10.64/1.69 cnf(i_0_7, plain, (meet(X7,join(X16,join(X7,X15)))=X7), inference(start_rule)). % 10.64/1.69 cnf(i_0_18, plain, (meet(X7,join(X16,join(X7,X15)))=X7), inference(extension_rule, [i_0_17])). % 10.64/1.69 cnf(i_0_35, plain, (meet(X5,join(X2,join(X5,X3)))!=X5), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_34, plain, (join(meet(X5,join(X2,join(X5,X3))),meet(X7,join(X16,join(X7,X15))))=join(X5,X7)), inference(extension_rule, [i_0_15])). % 10.64/1.69 cnf(i_0_43, plain, (join(X5,X7)!=meet(join(X5,X7),join(X2,join(join(X5,X7),X3)))), inference(closure_rule, [i_0_7])). % 10.64/1.69 cnf(i_0_41, plain, (join(meet(X5,join(X2,join(X5,X3))),meet(X7,join(X16,join(X7,X15))))=meet(join(X5,X7),join(X2,join(join(X5,X7),X3)))), inference(etableau_closure_rule, [i_0_41, ...])). % 10.64/1.69 # End printing tableau % 10.64/1.69 # SZS output end % 10.64/1.69 # Branches closed with saturation will be marked with an "s" % 10.64/1.69 # Child (10919) has found a proof. % 10.64/1.69 % 10.64/1.69 # Proof search is over... % 10.64/1.69 # Freeing feature tree %------------------------------------------------------------------------------