TSTP Solution File: RNG026-7 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : RNG026-7 : TPTP v8.1.0. Released v1.0.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 : n028.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 : Mon Jul 18 20:27:07 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG026-7 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 : n028.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 : Mon May 30 07:13:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 21 Number of unprocessed: 17
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 17 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 1 conjectures.
% 0.19/0.37 # There are 1 start rule candidates:
% 0.19/0.37 # Found 17 unit axioms.
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 0 extension rule candidate clauses
% 0.19/0.37 # 17 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.37 # Creating equality axioms
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 24 tableaux to operate on
% 0.19/0.46 # There were 1 total branch saturation attempts.
% 0.19/0.46 # There were 0 of these attempts blocked.
% 0.19/0.46 # There were 0 deferred branch saturation attempts.
% 0.19/0.46 # There were 0 free duplicated saturations.
% 0.19/0.46 # There were 1 total successful branch saturations.
% 0.19/0.46 # There were 0 successful branch saturations in interreduction.
% 0.19/0.46 # There were 0 successful branch saturations on the branch.
% 0.19/0.46 # There were 1 successful branch saturations after the branch.
% 0.19/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Begin clausification derivation
% 0.19/0.46
% 0.19/0.46 # End clausification derivation
% 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46 cnf(i_0_27, plain, (multiply(X1,additive_identity)=additive_identity)).
% 0.19/0.46 cnf(i_0_26, plain, (multiply(additive_identity,X1)=additive_identity)).
% 0.19/0.46 cnf(i_0_30, plain, (additive_inverse(additive_inverse(X1))=X1)).
% 0.19/0.46 cnf(i_0_25, plain, (add(X1,additive_identity)=X1)).
% 0.19/0.46 cnf(i_0_24, plain, (add(additive_identity,X1)=X1)).
% 0.19/0.46 cnf(i_0_29, plain, (add(X1,additive_inverse(X1))=additive_identity)).
% 0.19/0.46 cnf(i_0_41, plain, (additive_inverse(multiply(X1,X2))=multiply(X1,additive_inverse(X2)))).
% 0.19/0.46 cnf(i_0_40, plain, (multiply(additive_inverse(X1),X2)=multiply(X1,additive_inverse(X2)))).
% 0.19/0.46 cnf(i_0_34, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
% 0.19/0.46 cnf(i_0_35, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
% 0.19/0.46 cnf(i_0_36, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
% 0.19/0.46 cnf(i_0_31, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.19/0.46 cnf(i_0_32, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.19/0.46 cnf(i_0_43, plain, (add(multiply(X1,X2),multiply(X3,additive_inverse(X2)))=multiply(add(X1,additive_inverse(X3)),X2))).
% 0.19/0.46 cnf(i_0_44, plain, (multiply(X1,add(additive_inverse(X2),additive_inverse(X3)))=multiply(X1,additive_inverse(add(X2,X3))))).
% 0.19/0.46 cnf(i_0_33, plain, (add(X1,X2)=add(X2,X1))).
% 0.19/0.46 cnf(i_0_46, negated_conjecture, (add(multiply(multiply(multiply(a,b),c),d),add(multiply(multiply(a,b),multiply(c,additive_inverse(d))),add(multiply(multiply(a,b),multiply(c,d)),add(multiply(a,multiply(b,multiply(c,additive_inverse(d)))),additive_inverse(add(multiply(multiply(a,multiply(b,c)),d),add(multiply(a,multiply(multiply(b,c),additive_inverse(d))),add(multiply(a,add(multiply(multiply(b,c),d),multiply(b,multiply(c,additive_inverse(d))))),multiply(add(multiply(multiply(a,b),c),multiply(a,multiply(b,additive_inverse(c)))),d)))))))))!=additive_identity)).
% 0.19/0.46 cnf(i_0_48, plain, (X4=X4)).
% 0.19/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.46 # Begin printing tableau
% 0.19/0.46 # Found 6 steps
% 0.19/0.46 cnf(i_0_27, plain, (multiply(X6,additive_identity)=additive_identity), inference(start_rule)).
% 0.19/0.46 cnf(i_0_55, plain, (multiply(X6,additive_identity)=additive_identity), inference(extension_rule, [i_0_52])).
% 0.19/0.46 cnf(i_0_82, plain, (multiply(add(additive_identity,additive_identity),additive_identity)!=additive_identity), inference(closure_rule, [i_0_27])).
% 0.19/0.46 cnf(i_0_80, plain, (add(multiply(X6,additive_identity),multiply(add(additive_identity,additive_identity),additive_identity))=add(additive_identity,additive_identity)), inference(extension_rule, [i_0_51])).
% 0.19/0.46 cnf(i_0_94, plain, (add(additive_identity,additive_identity)!=additive_inverse(additive_inverse(add(additive_identity,additive_identity)))), inference(closure_rule, [i_0_30])).
% 0.19/0.46 cnf(i_0_92, plain, (add(multiply(X6,additive_identity),multiply(add(additive_identity,additive_identity),additive_identity))=additive_inverse(additive_inverse(add(additive_identity,additive_identity)))), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.19/0.46 # End printing tableau
% 0.19/0.46 # SZS output end
% 0.19/0.46 # Branches closed with saturation will be marked with an "s"
% 0.19/0.46 # Child (28781) has found a proof.
% 0.19/0.46
% 0.19/0.46 # Proof search is over...
% 0.19/0.46 # Freeing feature tree
%------------------------------------------------------------------------------