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