TSTP Solution File: HWV002-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV002-1 : TPTP v8.1.0. Released v1.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 : n012.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:26 EDT 2022
% Result : Unsatisfiable 155.31s 19.89s
% Output : CNFRefutation 155.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV002-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 03:53:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 49 Number of unprocessed: 49
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 49 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 38 conjectures.
% 0.12/0.37 # There are 38 start rule candidates:
% 0.12/0.37 # Found 48 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 38 start rule tableaux created.
% 0.12/0.37 # 1 extension rule candidate clauses
% 0.12/0.37 # 48 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 12.28/1.94 # Creating equality axioms
% 12.28/1.94 # Ran out of tableaux, making start rules for all clauses
% 12.28/1.95 # Creating equality axioms
% 12.28/1.95 # Ran out of tableaux, making start rules for all clauses
% 12.28/1.96 # Creating equality axioms
% 12.28/1.96 # Ran out of tableaux, making start rules for all clauses
% 12.28/1.97 # Creating equality axioms
% 12.28/1.97 # Ran out of tableaux, making start rules for all clauses
% 12.28/1.97 # Creating equality axioms
% 12.28/1.97 # Ran out of tableaux, making start rules for all clauses
% 12.28/1.98 # Creating equality axioms
% 12.28/1.98 # Ran out of tableaux, making start rules for all clauses
% 13.94/2.21 # Creating equality axioms
% 13.94/2.21 # Ran out of tableaux, making start rules for all clauses
% 16.73/2.49 # Creating equality axioms
% 16.73/2.49 # Ran out of tableaux, making start rules for all clauses
% 155.31/19.89 # There were 15 total branch saturation attempts.
% 155.31/19.89 # There were 0 of these attempts blocked.
% 155.31/19.89 # There were 0 deferred branch saturation attempts.
% 155.31/19.89 # There were 0 free duplicated saturations.
% 155.31/19.89 # There were 1 total successful branch saturations.
% 155.31/19.89 # There were 0 successful branch saturations in interreduction.
% 155.31/19.89 # There were 0 successful branch saturations on the branch.
% 155.31/19.89 # There were 1 successful branch saturations after the branch.
% 155.31/19.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 155.31/19.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 155.31/19.89 # Begin clausification derivation
% 155.31/19.89
% 155.31/19.89 # End clausification derivation
% 155.31/19.89 # Begin listing active clauses obtained from FOF to CNF conversion
% 155.31/19.89 cnf(i_0_69, negated_conjecture, (n13=o1)).
% 155.31/19.89 cnf(i_0_70, negated_conjecture, (o2=n17)).
% 155.31/19.89 cnf(i_0_71, negated_conjecture, (o3=n5)).
% 155.31/19.89 cnf(i_0_99, negated_conjecture, (circuit(o1))).
% 155.31/19.89 cnf(i_0_100, negated_conjecture, (circuit(n17))).
% 155.31/19.89 cnf(i_0_101, negated_conjecture, (circuit(n5))).
% 155.31/19.89 cnf(i_0_72, negated_conjecture, (and(inv1,i2)=a1)).
% 155.31/19.89 cnf(i_0_60, plain, (and(X1,X1)=X1)).
% 155.31/19.89 cnf(i_0_54, plain, (xor(X1,X1)=n0)).
% 155.31/19.89 cnf(i_0_53, plain, (xor(X1,n0)=X1)).
% 155.31/19.89 cnf(i_0_59, plain, (and(X1,n1)=X1)).
% 155.31/19.89 cnf(i_0_97, negated_conjecture, (xor(n1,n20)=inv1)).
% 155.31/19.89 cnf(i_0_73, negated_conjecture, (and(inv1,i3)=n2)).
% 155.31/19.89 cnf(i_0_86, negated_conjecture, (and(inv2,n6)=n15)).
% 155.31/19.89 cnf(i_0_92, negated_conjecture, (and(inv1,inv2)=n21)).
% 155.31/19.89 cnf(i_0_52, plain, (xor(n0,X1)=X1)).
% 155.31/19.89 cnf(i_0_58, plain, (and(n1,X1)=X1)).
% 155.31/19.89 cnf(i_0_57, plain, (and(X1,n0)=n0)).
% 155.31/19.89 cnf(i_0_56, plain, (and(n0,X1)=n0)).
% 155.31/19.89 cnf(i_0_98, negated_conjecture, (xor(n1,n9)=inv2)).
% 155.31/19.89 cnf(i_0_55, plain, (xor(X1,xor(X1,X2))=X2)).
% 155.31/19.89 cnf(i_0_61, plain, (and(X1,and(X1,X2))=and(X1,X2))).
% 155.31/19.89 cnf(i_0_85, negated_conjecture, (and(i3,i2)=n14)).
% 155.31/19.89 cnf(i_0_78, negated_conjecture, (and(i3,n6)=n7)).
% 155.31/19.89 cnf(i_0_95, negated_conjecture, (and(inv1,i1)=n24)).
% 155.31/19.89 cnf(i_0_77, negated_conjecture, (and(i2,i1)=n6)).
% 155.31/19.89 cnf(i_0_94, negated_conjecture, (and(i3,i1)=n23)).
% 155.31/19.89 cnf(i_0_87, negated_conjecture, (and(inv2,n14)=n16)).
% 155.31/19.89 cnf(i_0_90, negated_conjecture, (and(inv2,n23)=n19)).
% 155.31/19.89 cnf(i_0_62, plain, (xor(and(X1,X2),and(X1,X3))=and(X1,xor(X2,X3)))).
% 155.31/19.89 cnf(i_0_82, negated_conjecture, (xor(a1,xor(n2,and(a1,n2)))=n11)).
% 155.31/19.89 cnf(i_0_74, negated_conjecture, (xor(a1,xor(n24,and(a1,n24)))=n3)).
% 155.31/19.89 cnf(i_0_79, negated_conjecture, (xor(a1,xor(n10,and(a1,n10)))=n8)).
% 155.31/19.89 cnf(i_0_96, negated_conjecture, (xor(n2,xor(n24,and(n2,n24)))=n25)).
% 155.31/19.89 cnf(i_0_80, negated_conjecture, (xor(n2,xor(n8,and(n2,n8)))=n9)).
% 155.31/19.89 cnf(i_0_75, negated_conjecture, (xor(n3,xor(n15,and(n3,n15)))=n4)).
% 155.31/19.89 cnf(i_0_81, negated_conjecture, (xor(n24,xor(n7,and(n24,n7)))=n10)).
% 155.31/19.89 cnf(i_0_76, negated_conjecture, (xor(n21,xor(n4,and(n21,n4)))=n5)).
% 155.31/19.89 cnf(i_0_84, negated_conjecture, (xor(n21,xor(n12,and(n21,n12)))=o1)).
% 155.31/19.89 cnf(i_0_88, negated_conjecture, (xor(n21,xor(n18,and(n21,n18)))=n17)).
% 155.31/19.89 cnf(i_0_93, negated_conjecture, (xor(n6,xor(n23,and(n6,n23)))=n22)).
% 155.31/19.89 cnf(i_0_83, negated_conjecture, (xor(n11,xor(n16,and(n11,n16)))=n12)).
% 155.31/19.89 cnf(i_0_91, negated_conjecture, (xor(n14,xor(n22,and(n14,n22)))=n20)).
% 155.31/19.89 cnf(i_0_89, negated_conjecture, (xor(n19,xor(n25,and(n19,n25)))=n18)).
% 155.31/19.89 cnf(i_0_65, negated_conjecture, (xor(X1,X2)=xor(X2,X1))).
% 155.31/19.89 cnf(i_0_67, negated_conjecture, (and(X1,X2)=and(X2,X1))).
% 155.31/19.89 cnf(i_0_66, negated_conjecture, (xor(X1,xor(X2,X3))=xor(X2,xor(X1,X3)))).
% 155.31/19.89 cnf(i_0_68, negated_conjecture, (and(X1,and(X2,X3))=and(X2,and(X1,X3)))).
% 155.31/19.89 cnf(i_0_102, negated_conjecture, (~circuit(xor(i2,n1))|~circuit(xor(i3,n1))|~circuit(xor(i1,n1)))).
% 155.31/19.89 cnf(i_0_158, plain, (X4=X4)).
% 155.31/19.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 155.31/19.89 # Begin printing tableau
% 155.31/19.89 # Found 8 steps
% 155.31/19.89 cnf(i_0_158, plain, (X7=X7), inference(start_rule)).
% 155.31/19.89 cnf(i_0_216, plain, (X7=X7), inference(extension_rule, [i_0_162])).
% 155.31/19.89 cnf(i_0_229, plain, (n13!=o1), inference(closure_rule, [i_0_69])).
% 155.31/19.89 cnf(i_0_227, plain, (xor(X7,n13)=xor(X7,o1)), inference(extension_rule, [i_0_162])).
% 155.31/19.89 cnf(i_0_1725334, plain, (n13!=o1), inference(closure_rule, [i_0_69])).
% 155.31/19.89 cnf(i_0_1725332, plain, (xor(xor(X7,n13),n13)=xor(xor(X7,o1),o1)), inference(extension_rule, [i_0_161])).
% 155.31/19.89 cnf(i_0_1982816, plain, (xor(xor(X7,o1),o1)!=and(xor(xor(X7,o1),o1),xor(xor(X7,o1),o1))), inference(closure_rule, [i_0_60])).
% 155.31/19.89 cnf(i_0_1982814, plain, (xor(xor(X7,n13),n13)=and(xor(xor(X7,o1),o1),xor(xor(X7,o1),o1))), inference(etableau_closure_rule, [i_0_1982814, ...])).
% 155.31/19.89 # End printing tableau
% 155.31/19.89 # SZS output end
% 155.31/19.89 # Branches closed with saturation will be marked with an "s"
% 155.31/19.91 # Child (12720) has found a proof.
% 155.31/19.91
% 155.31/19.91 # Proof search is over...
% 155.31/19.91 # Freeing feature tree
%------------------------------------------------------------------------------