TSTP Solution File: HWV007-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.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 : n007.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.11s 0.31s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.26 % Computer : n007.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Thu Jun 16 22:38:26 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.07/0.28 # No SInE strategy applied
% 0.07/0.28 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.07/0.28 # and selection function SelectNewComplexAHPNS.
% 0.07/0.28 #
% 0.07/0.28 # Presaturation interreduction done
% 0.07/0.28 # Number of axioms: 56 Number of unprocessed: 56
% 0.07/0.28 # Tableaux proof search.
% 0.07/0.28 # APR header successfully linked.
% 0.07/0.28 # Hello from C++
% 0.07/0.28 # The folding up rule is enabled...
% 0.07/0.28 # Local unification is enabled...
% 0.07/0.28 # Any saturation attempts will use folding labels...
% 0.07/0.28 # 56 beginning clauses after preprocessing and clausification
% 0.07/0.28 # Creating start rules for all 5 conjectures.
% 0.07/0.28 # There are 5 start rule candidates:
% 0.07/0.28 # Found 9 unit axioms.
% 0.07/0.28 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.07/0.28 # 5 start rule tableaux created.
% 0.07/0.28 # 47 extension rule candidate clauses
% 0.07/0.28 # 9 unit axiom clauses
% 0.07/0.28
% 0.07/0.28 # Requested 8, 32 cores available to the main process.
% 0.07/0.28 # There are not enough tableaux to fork, creating more from the initial 5
% 0.07/0.28 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.07/0.28 # We now have 9 tableaux to operate on
% 0.11/0.31 # There were 5 total branch saturation attempts.
% 0.11/0.31 # There were 0 of these attempts blocked.
% 0.11/0.31 # There were 0 deferred branch saturation attempts.
% 0.11/0.31 # There were 0 free duplicated saturations.
% 0.11/0.31 # There were 5 total successful branch saturations.
% 0.11/0.31 # There were 0 successful branch saturations in interreduction.
% 0.11/0.31 # There were 0 successful branch saturations on the branch.
% 0.11/0.31 # There were 5 successful branch saturations after the branch.
% 0.11/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.31 # Begin clausification derivation
% 0.11/0.31
% 0.11/0.31 # End clausification derivation
% 0.11/0.31 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.31 cnf(i_0_102, hypothesis, (type(f,fulladder))).
% 0.11/0.31 cnf(i_0_103, hypothesis, (value(in(n1,f),n0))).
% 0.11/0.31 cnf(i_0_104, hypothesis, (value(in(n2,f),n1))).
% 0.11/0.31 cnf(i_0_105, hypothesis, (value(in(c,f),n1))).
% 0.11/0.31 cnf(i_0_106, hypothesis, (value(out(s,f),n1))).
% 0.11/0.31 cnf(i_0_107, hypothesis, (value(out(c,f),n0))).
% 0.11/0.31 cnf(i_0_108, negated_conjecture, (~mode(and2(h1(f)),abnormal))).
% 0.11/0.31 cnf(i_0_60, plain, (~equal_value(n0,n1))).
% 0.11/0.31 cnf(i_0_61, plain, (~equal_value(n1,n0))).
% 0.11/0.31 cnf(i_0_62, plain, (~mode(X1,ok)|~mode(X1,abnormal))).
% 0.11/0.31 cnf(i_0_109, negated_conjecture, (~mode(and1(h1(f)),abnormal)|~mode(or1(f),abnormal))).
% 0.11/0.31 cnf(i_0_111, negated_conjecture, (~mode(and1(h2(f)),abnormal)|~mode(or1(f),abnormal))).
% 0.11/0.31 cnf(i_0_110, negated_conjecture, (~mode(not1(h1(f)),abnormal)|~mode(or1(f),abnormal))).
% 0.11/0.31 cnf(i_0_112, negated_conjecture, (~mode(or1(h2(f)),abnormal)|~mode(or1(f),abnormal))).
% 0.11/0.31 cnf(i_0_78, plain, (type(and1(X1),and)|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_79, plain, (type(and2(X1),and)|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_80, plain, (type(not1(X1),not)|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_81, plain, (type(or1(X1),or)|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_93, plain, (type(or1(X1),or)|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_91, plain, (type(h1(X1),halfadder)|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_92, plain, (type(h2(X1),halfadder)|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_63, plain, (mode(X1,abnormal)|mode(X1,ok)|~type(X1,X2))).
% 0.11/0.31 cnf(i_0_57, plain, (value(X1,X2)|~value(X3,X2)|~connection(X3,X1))).
% 0.11/0.31 cnf(i_0_58, plain, (value(X1,X2)|~value(X3,X2)|~connection(X1,X3))).
% 0.11/0.31 cnf(i_0_59, plain, (equal_value(X1,X2)|~value(X3,X2)|~value(X3,X1))).
% 0.11/0.31 cnf(i_0_84, plain, (connection(in(n1,X1),in(n1,and2(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_82, plain, (connection(in(n1,X1),in(n1,or1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_97, plain, (connection(in(n1,X1),in(n1,h2(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_98, plain, (connection(in(n2,X1),in(n1,h1(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_85, plain, (connection(in(n2,X1),in(n2,and2(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_83, plain, (connection(in(n2,X1),in(n2,or1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_99, plain, (connection(in(c,X1),in(n2,h1(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_86, plain, (connection(out(s,X1),out(n1,and1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_100, plain, (connection(out(s,X1),out(s,h2(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_87, plain, (connection(out(c,X1),out(n1,and2(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_101, plain, (connection(out(c,X1),out(n1,or1(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_89, plain, (connection(out(n1,and2(X1)),in(n1,not1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_90, plain, (connection(out(n1,not1(X1)),in(n2,and1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_88, plain, (connection(out(n1,or1(X1)),in(n1,and1(X1)))|~type(X1,halfadder))).
% 0.11/0.31 cnf(i_0_94, plain, (connection(out(s,h1(X1)),in(n2,h2(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_95, plain, (connection(out(c,h1(X1)),in(n2,or1(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_96, plain, (connection(out(c,h2(X1)),in(n1,or1(X1)))|~type(X1,fulladder))).
% 0.11/0.31 cnf(i_0_72, plain, (value(in(n1,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n0))).
% 0.11/0.31 cnf(i_0_77, plain, (value(in(n1,X1),n0)|~type(X1,not)|~mode(X1,ok)|~value(out(n1,X1),n1))).
% 0.11/0.31 cnf(i_0_67, plain, (value(in(n1,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n1))).
% 0.11/0.31 cnf(i_0_76, plain, (value(in(n1,X1),n1)|~type(X1,not)|~mode(X1,ok)|~value(out(n1,X1),n0))).
% 0.11/0.31 cnf(i_0_73, plain, (value(in(n2,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n0))).
% 0.11/0.31 cnf(i_0_68, plain, (value(in(n2,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n1))).
% 0.11/0.31 cnf(i_0_75, plain, (value(out(n1,X1),n0)|~type(X1,not)|~mode(X1,ok)|~value(in(n1,X1),n1))).
% 0.11/0.31 cnf(i_0_74, plain, (value(out(n1,X1),n1)|~type(X1,not)|~mode(X1,ok)|~value(in(n1,X1),n0))).
% 0.11/0.31 cnf(i_0_64, plain, (value(out(n1,X1),n0)|~type(X1,and)|~mode(X1,ok)|~value(in(X2,X1),n0))).
% 0.11/0.31 cnf(i_0_69, plain, (value(out(n1,X1),n1)|~type(X1,or)|~mode(X1,ok)|~value(in(X2,X1),n1))).
% 0.11/0.31 cnf(i_0_66, plain, (value(in(n2,X1),n0)|value(in(n1,X1),n0)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n0))).
% 0.11/0.31 cnf(i_0_71, plain, (value(in(n2,X1),n1)|value(in(n1,X1),n1)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n1))).
% 0.11/0.31 cnf(i_0_70, plain, (value(out(n1,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(in(n1,X1),n0)|~value(in(n2,X1),n0))).
% 0.11/0.31 cnf(i_0_65, plain, (value(out(n1,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(in(n1,X1),n1)|~value(in(n2,X1),n1))).
% 0.11/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.31 # Begin printing tableau
% 0.11/0.31 # Found 8 steps
% 0.11/0.31 cnf(i_0_109, negated_conjecture, (~mode(and1(h1(f)),abnormal)|~mode(or1(f),abnormal)), inference(start_rule)).
% 0.11/0.31 cnf(i_0_120, plain, (~mode(or1(f),abnormal)), inference(extension_rule, [i_0_63])).
% 0.11/0.31 cnf(i_0_1049, plain, (mode(or1(f),ok)), inference(extension_rule, [i_0_72])).
% 0.11/0.31 cnf(i_0_119, plain, (~mode(and1(h1(f)),abnormal)), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.11/0.31 cnf(i_0_1050, plain, (~type(or1(f),X4)), inference(etableau_closure_rule, [i_0_1050, ...])).
% 0.11/0.31 cnf(i_0_1224, plain, (value(in(n1,or1(f)),n0)), inference(etableau_closure_rule, [i_0_1224, ...])).
% 0.11/0.31 cnf(i_0_1225, plain, (~type(or1(f),or)), inference(etableau_closure_rule, [i_0_1225, ...])).
% 0.11/0.31 cnf(i_0_1227, plain, (~value(out(n1,or1(f)),n0)), inference(etableau_closure_rule, [i_0_1227, ...])).
% 0.11/0.31 # End printing tableau
% 0.11/0.31 # SZS output end
% 0.11/0.31 # Branches closed with saturation will be marked with an "s"
% 0.11/0.31 # Child (10120) has found a proof.
% 0.11/0.31
% 0.11/0.31 # Proof search is over...
% 0.11/0.31 # Freeing feature tree
%------------------------------------------------------------------------------