%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM002-1 : TPTP v8.1.0. Released v1.0.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 : n010.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 : Mon Jul 18 09:38:15 EDT 2022 % Result : Unsatisfiable 9.03s 9.22s % Output : CNFRefutation 9.03s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM002-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/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.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jul 6 09:10:17 EDT 2022 % 0.19/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 1.47/1.68 # The folding up rule is enabled... % 1.47/1.68 # Local unification is enabled... % 1.47/1.68 # Any saturation attempts will use folding labels... % 1.47/1.68 # 13 beginning clauses after preprocessing and clausification % 1.47/1.68 # Creating start rules for all 1 conjectures. % 1.47/1.68 # There are 1 start rule candidates: % 1.47/1.68 # Found 8 unit axioms. % 1.47/1.68 # 1 start rule tableaux created. % 1.47/1.68 # 5 extension rule candidate clauses % 1.47/1.68 # 8 unit axiom clauses % 1.47/1.68 % 1.47/1.68 # Requested 8, 32 cores available to the main process. % 1.47/1.68 # There are not enough tableaux to fork, creating more from the initial 1 % 9.03/9.22 # There were 13 total branch saturation attempts. % 9.03/9.22 # There were 5 of these attempts blocked. % 9.03/9.22 # There were 0 deferred branch saturation attempts. % 9.03/9.22 # There were 0 free duplicated saturations. % 9.03/9.22 # There were 4 total successful branch saturations. % 9.03/9.22 # There were 0 successful branch saturations in interreduction. % 9.03/9.22 # There were 0 successful branch saturations on the branch. % 9.03/9.22 # There were 4 successful branch saturations after the branch. % 9.03/9.22 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.03/9.22 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.03/9.22 # Begin clausification derivation % 9.03/9.22 % 9.03/9.22 # End clausification derivation % 9.03/9.22 # Begin listing active clauses obtained from FOF to CNF conversion % 9.03/9.22 cnf(i_0_14, plain, (equalish(X1,X1))). % 9.03/9.22 cnf(i_0_16, plain, (equalish(add(X1,X2),add(X2,X1)))). % 9.03/9.22 cnf(i_0_19, plain, (equalish(X1,subtract(add(X1,X2),X2)))). % 9.03/9.22 cnf(i_0_18, plain, (equalish(subtract(add(X1,X2),X2),X1))). % 9.03/9.22 cnf(i_0_17, plain, (equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)))). % 9.03/9.22 cnf(i_0_20, plain, (equalish(add(subtract(X1,X2),X3),subtract(add(X1,X3),X2)))). % 9.03/9.22 cnf(i_0_21, plain, (equalish(subtract(add(X1,X2),X3),add(subtract(X1,X3),X2)))). % 9.03/9.22 cnf(i_0_26, negated_conjecture, (~equalish(add(subtract(a,b),c),add(a,subtract(c,b))))). % 9.03/9.22 cnf(i_0_15, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))). % 9.03/9.22 cnf(i_0_23, plain, (equalish(X1,add(X2,X3))|~equalish(X1,add(X2,X4))|~equalish(X4,X3))). % 9.03/9.22 cnf(i_0_22, plain, (equalish(X1,add(X2,X3))|~equalish(X1,add(X4,X3))|~equalish(X4,X2))). % 9.03/9.22 cnf(i_0_25, plain, (equalish(X1,subtract(X2,X3))|~equalish(X1,subtract(X2,X4))|~equalish(X4,X3))). % 9.03/9.22 cnf(i_0_24, plain, (equalish(X1,subtract(X2,X3))|~equalish(X1,subtract(X4,X3))|~equalish(X4,X2))). % 9.03/9.22 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.03/9.22 # Begin printing tableau % 9.03/9.22 # Found 12 steps % 9.03/9.22 cnf(i_0_26, negated_conjecture, (~equalish(add(subtract(a,b),c),add(a,subtract(c,b)))), inference(start_rule)). % 9.03/9.22 cnf(i_0_27, plain, (~equalish(add(subtract(a,b),c),add(a,subtract(c,b)))), inference(extension_rule, [i_0_23])). % 9.03/9.22 cnf(i_0_32, plain, (~equalish(add(subtract(a,b),c),add(a,subtract(c,b)))), inference(extension_rule, [i_0_15])). % 9.03/9.22 cnf(i_0_33, plain, (~equalish(subtract(c,b),subtract(c,b))), inference(extension_rule, [i_0_24])). % 9.03/9.22 cnf(i_0_1196780, plain, (~equalish(subtract(c,b),subtract(c,b))), inference(closure_rule, [i_0_14])). % 9.03/9.22 cnf(i_0_1196781, plain, (~equalish(c,c)), inference(closure_rule, [i_0_14])). % 9.03/9.22 cnf(i_0_382195, plain, (~equalish(add(subtract(a,b),subtract(c,b)),add(a,subtract(c,b)))), inference(extension_rule, [i_0_22])). % 9.03/9.22 cnf(i_0_1196834, plain, (~equalish(add(subtract(a,b),subtract(c,b)),add(subtract(a,b),subtract(c,b)))), inference(closure_rule, [i_0_14])). % 9.03/9.22 cnf(i_0_382196, plain, (~equalish(add(subtract(a,b),c),add(subtract(a,b),subtract(c,b)))), inference(extension_rule, [i_0_23])). % 9.03/9.22 cnf(i_0_1196861, plain, (~equalish(add(subtract(a,b),c),add(subtract(a,b),c))), inference(closure_rule, [i_0_14])). % 9.03/9.22 cnf(i_0_1196835, plain, (~equalish(subtract(a,b),a)), inference(etableau_closure_rule, [i_0_1196835, ...])). % 9.03/9.22 cnf(i_0_1196862, plain, (~equalish(c,subtract(c,b))), inference(etableau_closure_rule, [i_0_1196862, ...])). % 9.03/9.22 # End printing tableau % 9.03/9.22 # SZS output end % 9.03/9.22 # Branches closed with saturation will be marked with an "s" % 9.03/9.22 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 9.03/9.22 # We now have 5 tableaux to operate on % 9.03/9.22 # Found closed tableau during pool population. % 9.03/9.22 # Proof search is over... % 9.03/9.22 # Freeing feature tree %------------------------------------------------------------------------------