TSTP Solution File: HWV003-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV003-2 : TPTP v8.1.0. Released 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 : n006.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:27 EDT 2022
% Result : Unsatisfiable 29.26s 4.15s
% Output : CNFRefutation 29.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : HWV003-2 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.35 % Computer : n006.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Fri Jun 17 06:11:11 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.38 # No SInE strategy applied
% 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.38 #
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38 # Number of axioms: 35 Number of unprocessed: 34
% 0.12/0.38 # Tableaux proof search.
% 0.12/0.38 # APR header successfully linked.
% 0.12/0.38 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 34 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 12 conjectures.
% 0.12/0.38 # There are 12 start rule candidates:
% 0.12/0.38 # Found 33 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 12 start rule tableaux created.
% 0.12/0.38 # 1 extension rule candidate clauses
% 0.12/0.38 # 33 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 26.94/3.84 # Creating equality axioms
% 26.94/3.84 # Ran out of tableaux, making start rules for all clauses
% 27.39/3.91 # Creating equality axioms
% 27.39/3.91 # Ran out of tableaux, making start rules for all clauses
% 27.39/3.92 # Creating equality axioms
% 27.39/3.92 # Ran out of tableaux, making start rules for all clauses
% 27.39/3.94 # Creating equality axioms
% 27.39/3.94 # Ran out of tableaux, making start rules for all clauses
% 28.08/3.98 # Creating equality axioms
% 28.08/3.98 # Ran out of tableaux, making start rules for all clauses
% 28.70/4.05 # Creating equality axioms
% 28.70/4.05 # Ran out of tableaux, making start rules for all clauses
% 28.70/4.07 # Creating equality axioms
% 28.70/4.07 # Ran out of tableaux, making start rules for all clauses
% 29.26/4.12 # Creating equality axioms
% 29.26/4.12 # Ran out of tableaux, making start rules for all clauses
% 29.26/4.15 # There were 1 total branch saturation attempts.
% 29.26/4.15 # There were 0 of these attempts blocked.
% 29.26/4.15 # There were 0 deferred branch saturation attempts.
% 29.26/4.15 # There were 0 free duplicated saturations.
% 29.26/4.15 # There were 1 total successful branch saturations.
% 29.26/4.15 # There were 0 successful branch saturations in interreduction.
% 29.26/4.15 # There were 0 successful branch saturations on the branch.
% 29.26/4.15 # There were 1 successful branch saturations after the branch.
% 29.26/4.15 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.26/4.15 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.26/4.15 # Begin clausification derivation
% 29.26/4.15
% 29.26/4.15 # End clausification derivation
% 29.26/4.15 # Begin listing active clauses obtained from FOF to CNF conversion
% 29.26/4.15 cnf(i_0_63, negated_conjecture, (not(and(a,b))=t1)).
% 29.26/4.15 cnf(i_0_64, negated_conjecture, (not(and(a,t1))=t2)).
% 29.26/4.15 cnf(i_0_65, negated_conjecture, (not(and(b,t1))=t3)).
% 29.26/4.15 cnf(i_0_71, negated_conjecture, (not(and(t1,t5))=carry)).
% 29.26/4.15 cnf(i_0_50, plain, (not(ll0)=ll1)).
% 29.26/4.15 cnf(i_0_51, plain, (not(ll1)=ll0)).
% 29.26/4.15 cnf(i_0_47, plain, (or(X1,X1)=X1)).
% 29.26/4.15 cnf(i_0_48, plain, (and(X1,X1)=X1)).
% 29.26/4.15 cnf(i_0_49, plain, (not(not(X1))=X1)).
% 29.26/4.15 cnf(i_0_41, plain, (or(X1,ll0)=X1)).
% 29.26/4.15 cnf(i_0_66, negated_conjecture, (not(and(t2,t3))=t4)).
% 29.26/4.15 cnf(i_0_70, negated_conjecture, (not(and(t6,t7))=sum)).
% 29.26/4.15 cnf(i_0_52, plain, (or(X1,ll1)=ll1)).
% 29.26/4.15 cnf(i_0_53, plain, (and(X1,ll0)=ll0)).
% 29.26/4.15 cnf(i_0_42, plain, (and(X1,ll1)=X1)).
% 29.26/4.15 cnf(i_0_45, plain, (or(X1,not(X1))=ll1)).
% 29.26/4.15 cnf(i_0_46, plain, (and(X1,not(X1))=ll0)).
% 29.26/4.15 cnf(i_0_54, plain, (or(X1,and(X1,X2))=X1)).
% 29.26/4.15 cnf(i_0_55, plain, (and(X1,or(X1,X2))=X1)).
% 29.26/4.15 cnf(i_0_56, plain, (not(or(X1,X2))=and(not(X1),not(X2)))).
% 29.26/4.15 cnf(i_0_57, plain, (or(not(X1),not(X2))=not(and(X1,X2)))).
% 29.26/4.15 cnf(i_0_39, plain, (or(or(X1,X2),X3)=or(X1,or(X2,X3)))).
% 29.26/4.15 cnf(i_0_40, plain, (and(and(X1,X2),X3)=and(X1,and(X2,X3)))).
% 29.26/4.15 cnf(i_0_44, plain, (and(or(X1,X2),or(X1,X3))=or(X1,and(X2,X3)))).
% 29.26/4.15 cnf(i_0_43, plain, (or(and(X1,X2),and(X1,X3))=and(X1,or(X2,X3)))).
% 29.26/4.15 cnf(i_0_67, negated_conjecture, (not(and(cin,t4))=t5)).
% 29.26/4.15 cnf(i_0_68, negated_conjecture, (not(and(t5,t4))=t6)).
% 29.26/4.15 cnf(i_0_69, negated_conjecture, (not(and(cin,t5))=t7)).
% 29.26/4.15 cnf(i_0_62, negated_conjecture, (or(and(a,and(b,not(cin))),and(cin,or(a,b)))=carry_def)).
% 29.26/4.15 cnf(i_0_61, negated_conjecture, (or(and(not(cin),or(and(a,not(b)),and(b,not(a)))),and(not(and(a,not(b))),and(cin,not(and(b,not(a))))))=sum_def)).
% 29.26/4.15 cnf(i_0_37, plain, (or(X1,X2)=or(X2,X1))).
% 29.26/4.15 cnf(i_0_38, plain, (and(X1,X2)=and(X2,X1))).
% 29.26/4.15 cnf(i_0_60, plain, (or(and(X1,and(not(and(X2,not(X3))),not(and(not(X2),X3)))),and(not(X1),or(and(X2,not(X3)),and(not(X2),X3))))=or(and(not(and(X1,not(X2))),and(not(and(not(X1),X2)),X3)),and(or(and(X1,not(X2)),and(not(X1),X2)),not(X3))))).
% 29.26/4.15 cnf(i_0_72, negated_conjecture, (sum_def!=sum|carry_def!=carry)).
% 29.26/4.15 cnf(i_0_90, plain, (X4=X4)).
% 29.26/4.15 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 29.26/4.15 # Begin printing tableau
% 29.26/4.15 # Found 6 steps
% 29.26/4.15 cnf(i_0_90, plain, (t1=t1), inference(start_rule)).
% 29.26/4.15 cnf(i_0_132, plain, (t1=t1), inference(extension_rule, [i_0_94])).
% 29.26/4.15 cnf(i_0_144, plain, (not(and(a,b))!=t1), inference(closure_rule, [i_0_63])).
% 29.26/4.15 cnf(i_0_142, plain, (or(t1,not(and(a,b)))=or(t1,t1)), inference(extension_rule, [i_0_93])).
% 29.26/4.15 cnf(i_0_153, plain, (or(t1,t1)!=t1), inference(closure_rule, [i_0_47])).
% 29.26/4.15 cnf(i_0_151, plain, (or(t1,not(and(a,b)))=t1), inference(etableau_closure_rule, [i_0_151, ...])).
% 29.26/4.15 # End printing tableau
% 29.26/4.15 # SZS output end
% 29.26/4.15 # Branches closed with saturation will be marked with an "s"
% 29.67/4.16 # Child (349) has found a proof.
% 29.67/4.16
% 29.67/4.16 # Proof search is over...
% 29.67/4.16 # Freeing feature tree
%------------------------------------------------------------------------------