%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.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 : n025.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 : Sat Jul 16 14:10:30 EDT 2022 % Result : Unsatisfiable 0.18s 0.43s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n025.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jun 17 04:41:57 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 66 Number of unprocessed: 66 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 66 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 3 conjectures. % 0.13/0.37 # There are 3 start rule candidates: % 0.13/0.37 # Found 9 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 3 start rule tableaux created. % 0.13/0.37 # 57 extension rule candidate clauses % 0.13/0.37 # 9 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 9 tableaux to operate on % 0.18/0.43 # There were 3 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 0 free duplicated saturations. % 0.18/0.43 # There were 3 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 3 successful branch saturations after the branch. % 0.18/0.43 # There were 3 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 0 free duplicated saturations. % 0.18/0.43 # There were 3 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 3 successful branch saturations after the branch. % 0.18/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_124, hypothesis, (nbit_adder1(a))). % 0.18/0.43 cnf(i_0_128, hypothesis, (zero(out1(a)))). % 0.18/0.43 cnf(i_0_127, hypothesis, (zero(inc(a)))). % 0.18/0.43 cnf(i_0_125, hypothesis, (zero(ina1(a)))). % 0.18/0.43 cnf(i_0_126, hypothesis, (zero(inb1(a)))). % 0.18/0.43 cnf(i_0_129, hypothesis, (one(outc(a)))). % 0.18/0.43 cnf(i_0_130, negated_conjecture, (~abnormal(or1(f1(a))))). % 0.18/0.43 cnf(i_0_131, negated_conjecture, (~abnormal(and2(h1(f1(a)))))). % 0.18/0.43 cnf(i_0_132, negated_conjecture, (~abnormal(and2(h2(f1(a)))))). % 0.18/0.43 cnf(i_0_78, plain, (~abnormal(X1)|~and_ok(X1))). % 0.18/0.43 cnf(i_0_71, plain, (~one(X1)|~zero(X1))). % 0.18/0.43 cnf(i_0_86, plain, (~or_ok(X1)|~abnormal(X1))). % 0.18/0.43 cnf(i_0_92, plain, (~not_ok(X1)|~abnormal(X1))). % 0.18/0.43 cnf(i_0_67, plain, (zero(X1)|~zero(X2)|~connection(X2,X1))). % 0.18/0.43 cnf(i_0_95, plain, (logic_and(and2(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_97, plain, (logic_or(or1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_79, plain, (abnormal(X1)|and_ok(X1)|~logic_and(X1))). % 0.18/0.43 cnf(i_0_109, plain, (logic_or(or1(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_69, plain, (zero(X1)|~zero(X2)|~connection(X1,X2))). % 0.18/0.43 cnf(i_0_94, plain, (logic_and(and1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_96, plain, (logic_not(not1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_107, plain, (halfadder(h1(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_108, plain, (halfadder(h2(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_118, plain, (fulladder(f1(X1))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_87, plain, (or_ok(X1)|abnormal(X1)|~logic_or(X1))). % 0.18/0.43 cnf(i_0_93, plain, (not_ok(X1)|abnormal(X1)|~logic_not(X1))). % 0.18/0.43 cnf(i_0_84, plain, (zero(in1(X1))|~or_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_68, plain, (one(X1)|~one(X2)|~connection(X2,X1))). % 0.18/0.43 cnf(i_0_91, plain, (zero(in1(X1))|~not_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_72, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in1(X1)))). % 0.18/0.43 cnf(i_0_73, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in2(X1)))). % 0.18/0.43 cnf(i_0_89, plain, (zero(out1(X1))|~not_ok(X1)|~one(in1(X1)))). % 0.18/0.43 cnf(i_0_85, plain, (zero(in2(X1))|~or_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_76, plain, (one(in1(X1))|~and_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_90, plain, (one(in1(X1))|~not_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_80, plain, (one(out1(X1))|~or_ok(X1)|~one(in1(X1)))). % 0.18/0.43 cnf(i_0_81, plain, (one(out1(X1))|~or_ok(X1)|~one(in2(X1)))). % 0.18/0.43 cnf(i_0_88, plain, (one(out1(X1))|~not_ok(X1)|~zero(in1(X1)))). % 0.18/0.43 cnf(i_0_70, plain, (one(X1)|~one(X2)|~connection(X1,X2))). % 0.18/0.43 cnf(i_0_77, plain, (one(in2(X1))|~and_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_82, plain, (zero(out1(X1))|~or_ok(X1)|~zero(in1(X1))|~zero(in2(X1)))). % 0.18/0.43 cnf(i_0_74, plain, (one(out1(X1))|~and_ok(X1)|~one(in1(X1))|~one(in2(X1)))). % 0.18/0.43 cnf(i_0_75, plain, (zero(in2(X1))|zero(in1(X1))|~and_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_83, plain, (one(in2(X1))|one(in1(X1))|~or_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_100, plain, (connection(in1(X1),in1(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_98, plain, (connection(in1(X1),in1(or1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_113, plain, (connection(in1(X1),in1(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_119, plain, (connection(out1(X1),outs(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_114, plain, (connection(in2(X1),in1(h1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_101, plain, (connection(in2(X1),in2(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_99, plain, (connection(in2(X1),in2(or1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_102, plain, (connection(outs(X1),out1(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_116, plain, (connection(outs(X1),outs(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_103, plain, (connection(outc(X1),out1(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_117, plain, (connection(outc(X1),out1(or1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_120, plain, (connection(outc(X1),outc(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_115, plain, (connection(inc(X1),in2(h1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_123, plain, (connection(inc(X1),inc(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_121, plain, (connection(ina1(X1),in1(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_122, plain, (connection(inb1(X1),in2(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_105, plain, (connection(out1(and2(X1)),in# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_124, hypothesis, (nbit_adder1(a))). % 0.18/0.43 cnf(i_0_128, hypothesis, (zero(out1(a)))). % 0.18/0.43 cnf(i_0_127, hypothesis, (zero(inc(a)))). % 0.18/0.43 cnf(i_0_125, hypothesis, (zero(ina1(a)))). % 0.18/0.43 cnf(i_0_126, hypothesis, (zero(inb1(a)))). % 0.18/0.43 cnf(i_0_129, hypothesis, (one(outc(a)))). % 0.18/0.43 cnf(i_0_130, negated_conjecture, (~abnormal(or1(f1(a))))). % 0.18/0.43 cnf(i_0_131, negated_conjecture, (~abnormal(and2(h1(f1(a)))))). % 0.18/0.43 cnf(i_0_132, negated_conjecture, (~abnormal(and2(h2(f1(a)))))). % 0.18/0.43 cnf(i_0_78, plain, (~abnormal(X1)|~and_ok(X1))). % 0.18/0.43 cnf(i_0_71, plain, (~one(X1)|~zero(X1))). % 0.18/0.43 cnf(i_0_86, plain, (~or_ok(X1)|~abnormal(X1))). % 0.18/0.43 cnf(i_0_92, plain, (~not_ok(X1)|~abnormal(X1))). % 0.18/0.43 cnf(i_0_67, plain, (zero(X1)|~zero(X2)|~connection(X2,X1))). % 0.18/0.43 cnf(i_0_95, plain, (logic_and(and2(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_97, plain, (logic_or(or1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_79, plain, (abnormal(X1)|and_ok(X1)|~logic_and(X1))). % 0.18/0.43 cnf(i_0_109, plain, (logic_or(or1(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_69, plain, (zero(X1)|~zero(X2)|~connection(X1,X2))). % 0.18/0.43 cnf(i_0_94, plain, (logic_and(and1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_96, plain, (logic_not(not1(X1))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_107, plain, (halfadder(h1(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_108, plain, (halfadder(h2(X1))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_118, plain, (fulladder(f1(X1))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_87, plain, (or_ok(X1)|abnormal(X1)|~logic_or(X1))). % 0.18/0.43 cnf(i_0_93, plain, (not_ok(X1)|abnormal(X1)|~logic_not(X1))). % 0.18/0.43 cnf(i_0_84, plain, (zero(in1(X1))|~or_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_68, plain, (one(X1)|~one(X2)|~connection(X2,X1))). % 0.18/0.43 cnf(i_0_91, plain, (zero(in1(X1))|~not_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_72, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in1(X1)))). % 0.18/0.43 cnf(i_0_73, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in2(X1)))). % 0.18/0.43 cnf(i_0_89, plain, (zero(out1(X1))|~not_ok(X1)|~one(in1(X1)))). % 0.18/0.43 cnf(i_0_85, plain, (zero(in2(X1))|~or_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_76, plain, (one(in1(X1))|~and_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_90, plain, (one(in1(X1))|~not_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_80, plain, (one(out1(X1))|~or_ok(X1)|~one(in1(X1)))). % 0.18/0.43 cnf(i_0_81, plain, (one(out1(X1))|~or_ok(X1)|~one(in2(X1)))). % 0.18/0.43 cnf(i_0_88, plain, (one(out1(X1))|~not_ok(X1)|~zero(in1(X1)))). % 0.18/0.43 cnf(i_0_70, plain, (one(X1)|~one(X2)|~connection(X1,X2))). % 0.18/0.43 cnf(i_0_77, plain, (one(in2(X1))|~and_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_82, plain, (zero(out1(X1))|~or_ok(X1)|~zero(in1(X1))|~zero(in2(X1)))). % 0.18/0.43 cnf(i_0_74, plain, (one(out1(X1))|~and_ok(X1)|~one(in1(X1))|~one(in2(X1)))). % 0.18/0.43 cnf(i_0_75, plain, (zero(in2(X1))|zero(in1(X1))|~and_ok(X1)|~zero(out1(X1)))). % 0.18/0.43 cnf(i_0_83, plain, (one(in2(X1))|one(in1(X1))|~or_ok(X1)|~one(out1(X1)))). % 0.18/0.43 cnf(i_0_100, plain, (connection(in1(X1),in1(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_98, plain, (connection(in1(X1),in1(or1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_113, plain, (connection(in1(X1),in1(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_119, plain, (connection(out1(X1),outs(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_114, plain, (connection(in2(X1),in1(h1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_101, plain, (connection(in2(X1),in2(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_99, plain, (connection(in2(X1),in2(or1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_102, plain, (connection(outs(X1),out1(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_116, plain, (connection(outs(X1),outs(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_103, plain, (connection(outc(X1),out1(and2(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_117, plain, (connection(outc(X1),out1(or1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_120, plain, (connection(outc(X1),outc(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_115, plain, (connection(inc(X1),in2(h1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_123, plain, (connection(inc(X1),inc(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_121, plain, (connection(ina1(X1),in1(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_122, plain, (connection(inb1(X1),in2(f1(X1)))|~nbit_adder1(X1))). % 0.18/0.43 cnf(i_0_105, plain, (connection(out1(and2(X1)),in1(not1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_110, plain, (connection(outs(h1(X1)),in2(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_106, plain, (connection(out1(not1(X1)),in2(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_104, plain, (connection(out1(or1(X1)),in1(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_111, plain, (connection(outc(h1(X1)),in2(or1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_112, plain, (connection(outc(h2(X1)),in1(or1(X1)))|~fulladder(X1))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 6 steps % 0.18/0.43 cnf(i_0_130, negated_conjecture, (~abnormal(or1(f1(a)))), inference(start_rule)). % 0.18/0.43 cnf(i_0_135, plain, (~abnormal(or1(f1(a)))), inference(extension_rule, [i_0_87])). % 0.18/0.43 cnf(i_0_451, plain, (or_ok(or1(f1(a)))), inference(extension_rule, [i_0_84])). % 0.18/0.43 cnf(i_0_453, plain, (~logic_or(or1(f1(a)))), inference(etableau_closure_rule, [i_0_453, ...])). % 0.18/0.43 cnf(i_0_598, plain, (zero(in1(or1(f1(a))))), inference(etableau_closure_rule, [i_0_598, ...])). % 0.18/0.43 cnf(i_0_600, plain, (~zero(out1(or1(f1(a))))), inference(etableau_closure_rule, [i_0_600, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.43 1(not1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_110, plain, (connection(outs(h1(X1)),in2(h2(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_106, plain, (connection(out1(not1(X1)),in2(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_104, plain, (connection(out1(or1(X1)),in1(and1(X1)))|~halfadder(X1))). % 0.18/0.43 cnf(i_0_111, plain, (connection(outc(h1(X1)),in2(or1(X1)))|~fulladder(X1))). % 0.18/0.43 cnf(i_0_112, plain, (connection(outc(h2(X1)),in1(or1(X1)))|~fulladder(X1))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 6 steps % 0.18/0.43 cnf(i_0_131, negated_conjecture, (~abnormal(and2(h1(f1(a))))), inference(start_rule)). % 0.18/0.43 cnf(i_0_134, plain, (~abnormal(and2(h1(f1(a))))), inference(extension_rule, [i_0_79])). % 0.18/0.43 cnf(i_0_293, plain, (and_ok(and2(h1(f1(a))))), inference(extension_rule, [i_0_72])). % 0.18/0.43 cnf(i_0_294, plain, (~logic_and(and2(h1(f1(a))))), inference(etableau_closure_rule, [i_0_294, ...])). % 0.18/0.43 cnf(i_0_607, plain, (zero(out1(and2(h1(f1(a)))))), inference(etableau_closure_rule, [i_0_607, ...])). % 0.18/0.43 cnf(i_0_609, plain, (~zero(in1(and2(h1(f1(a)))))), inference(etableau_closure_rule, [i_0_609, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.43 # Child (5366) has found a proof. % 0.18/0.43 % 0.18/0.43 # Proof search is over... % 0.18/0.43 # Freeing feature tree %------------------------------------------------------------------------------