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