TSTP Solution File: HWV005-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV005-2 : 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 : n011.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:28 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : HWV005-2 : 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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 07:55:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_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: 48 Number of unprocessed: 48
% 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 # 48 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 8 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 # 40 extension rule candidate clauses
% 0.13/0.37 # 8 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.20/0.39 # There were 3 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 3 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 3 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_89, hypothesis, (halfadder(h))).
% 0.20/0.39 cnf(i_0_91, hypothesis, (zero(in2(h)))).
% 0.20/0.39 cnf(i_0_92, hypothesis, (zero(outs(h)))).
% 0.20/0.39 cnf(i_0_93, hypothesis, (zero(outc(h)))).
% 0.20/0.39 cnf(i_0_90, hypothesis, (one(in1(h)))).
% 0.20/0.39 cnf(i_0_94, negated_conjecture, (~abnormal(and1(h)))).
% 0.20/0.39 cnf(i_0_95, negated_conjecture, (~abnormal(not1(h)))).
% 0.20/0.39 cnf(i_0_96, negated_conjecture, (~abnormal(or1(h)))).
% 0.20/0.39 cnf(i_0_60, plain, (~abnormal(X1)|~and_ok(X1))).
% 0.20/0.39 cnf(i_0_53, plain, (~one(X1)|~zero(X1))).
% 0.20/0.39 cnf(i_0_68, plain, (~or_ok(X1)|~abnormal(X1))).
% 0.20/0.39 cnf(i_0_74, plain, (~not_ok(X1)|~abnormal(X1))).
% 0.20/0.39 cnf(i_0_49, plain, (zero(X1)|~zero(X2)|~connection(X2,X1))).
% 0.20/0.39 cnf(i_0_76, plain, (logic_and(and1(X1))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_79, plain, (logic_or(or1(X1))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_78, plain, (logic_not(not1(X1))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_61, plain, (abnormal(X1)|and_ok(X1)|~logic_and(X1))).
% 0.20/0.39 cnf(i_0_77, plain, (logic_and(and2(X1))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_51, plain, (zero(X1)|~zero(X2)|~connection(X1,X2))).
% 0.20/0.39 cnf(i_0_50, plain, (one(X1)|~one(X2)|~connection(X2,X1))).
% 0.20/0.39 cnf(i_0_52, plain, (one(X1)|~one(X2)|~connection(X1,X2))).
% 0.20/0.39 cnf(i_0_69, plain, (or_ok(X1)|abnormal(X1)|~logic_or(X1))).
% 0.20/0.39 cnf(i_0_75, plain, (not_ok(X1)|abnormal(X1)|~logic_not(X1))).
% 0.20/0.39 cnf(i_0_66, plain, (zero(in1(X1))|~or_ok(X1)|~zero(out1(X1)))).
% 0.20/0.39 cnf(i_0_73, plain, (zero(in1(X1))|~not_ok(X1)|~one(out1(X1)))).
% 0.20/0.39 cnf(i_0_54, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in1(X1)))).
% 0.20/0.39 cnf(i_0_55, plain, (zero(out1(X1))|~and_ok(X1)|~zero(in2(X1)))).
% 0.20/0.39 cnf(i_0_71, plain, (zero(out1(X1))|~not_ok(X1)|~one(in1(X1)))).
% 0.20/0.39 cnf(i_0_67, plain, (zero(in2(X1))|~or_ok(X1)|~zero(out1(X1)))).
% 0.20/0.39 cnf(i_0_58, plain, (one(in1(X1))|~and_ok(X1)|~one(out1(X1)))).
% 0.20/0.39 cnf(i_0_72, plain, (one(in1(X1))|~not_ok(X1)|~zero(out1(X1)))).
% 0.20/0.39 cnf(i_0_62, plain, (one(out1(X1))|~or_ok(X1)|~one(in1(X1)))).
% 0.20/0.39 cnf(i_0_63, plain, (one(out1(X1))|~or_ok(X1)|~one(in2(X1)))).
% 0.20/0.39 cnf(i_0_70, plain, (one(out1(X1))|~not_ok(X1)|~zero(in1(X1)))).
% 0.20/0.39 cnf(i_0_59, plain, (one(in2(X1))|~and_ok(X1)|~one(out1(X1)))).
% 0.20/0.39 cnf(i_0_80, plain, (connection(in1(X1),in1(or1(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_81, plain, (connection(in2(X1),in2(or1(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_84, plain, (connection(outs(X1),out1(and1(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_57, plain, (zero(in2(X1))|zero(in1(X1))|~and_ok(X1)|~zero(out1(X1)))).
% 0.20/0.39 cnf(i_0_82, plain, (connection(in1(X1),in1(and2(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_64, plain, (zero(out1(X1))|~or_ok(X1)|~zero(in1(X1))|~zero(in2(X1)))).
% 0.20/0.39 cnf(i_0_56, plain, (one(out1(X1))|~and_ok(X1)|~one(in1(X1))|~one(in2(X1)))).
% 0.20/0.39 cnf(i_0_65, plain, (one(in2(X1))|one(in1(X1))|~or_ok(X1)|~one(out1(X1)))).
% 0.20/0.39 cnf(i_0_83, plain, (connection(in2(X1),in2(and2(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_85, plain, (connection(outc(X1),out1(and2(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_88, plain, (connection(out1(not1(X1)),in2(and1(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_86, plain, (connection(out1(or1(X1)),in1(and1(X1)))|~halfadder(X1))).
% 0.20/0.39 cnf(i_0_87, plain, (connection(out1(and2(X1)),in1(not1(X1)))|~halfadder(X1))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_94, negated_conjecture, (~abnormal(and1(h))), inference(start_rule)).
% 0.20/0.39 cnf(i_0_99, plain, (~abnormal(and1(h))), inference(extension_rule, [i_0_75])).
% 0.20/0.39 cnf(i_0_348, plain, (not_ok(and1(h))), inference(extension_rule, [i_0_73])).
% 0.20/0.39 cnf(i_0_350, plain, (~logic_not(and1(h))), inference(etableau_closure_rule, [i_0_350, ...])).
% 0.20/0.39 cnf(i_0_461, plain, (zero(in1(and1(h)))), inference(etableau_closure_rule, [i_0_461, ...])).
% 0.20/0.39 cnf(i_0_463, plain, (~one(out1(and1(h)))), inference(etableau_closure_rule, [i_0_463, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Child (11089) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------