TSTP Solution File: RNG040-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : RNG040-2 : 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 : n025.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:10 EDT 2022
% Result : Unsatisfiable 235.00s 30.18s
% Output : CNFRefutation 235.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : n025.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 : Mon May 30 07:07:42 EDT 2022
% 0.13/0.34 % 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: 25 Number of unprocessed: 25
% 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 # 25 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 13 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 12 extension rule candidate clauses
% 0.13/0.37 # 13 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 5
% 0.13/0.37 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 21 tableaux to operate on
% 235.00/30.18 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done.
% 235.00/30.18 # There were 47 total branch saturation attempts.
% 235.00/30.18 # There were 1 of these attempts blocked.
% 235.00/30.18 # There were 0 deferred branch saturation attempts.
% 235.00/30.18 # There were 0 free duplicated saturations.
% 235.00/30.18 # There were 3 total successful branch saturations.
% 235.00/30.18 # There were 1 successful branch saturations in interreduction.
% 235.00/30.18 # There were 0 successful branch saturations on the branch.
% 235.00/30.18 # There were 2 successful branch saturations after the branch.
% 235.00/30.18 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 235.00/30.18 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 235.00/30.18 # Begin clausification derivation
% 235.00/30.18
% 235.00/30.18 # End clausification derivation
% 235.00/30.18 # Begin listing active clauses obtained from FOF to CNF conversion
% 235.00/30.18 cnf(i_0_46, negated_conjecture, (sum(b,c,d))).
% 235.00/30.18 cnf(i_0_48, negated_conjecture, (product(b,a,l))).
% 235.00/30.18 cnf(i_0_49, negated_conjecture, (product(c,a,n))).
% 235.00/30.18 cnf(i_0_47, negated_conjecture, (product(d,a,additive_identity))).
% 235.00/30.18 cnf(i_0_27, plain, (sum(X1,additive_identity,X1))).
% 235.00/30.18 cnf(i_0_26, plain, (sum(additive_identity,X1,X1))).
% 235.00/30.18 cnf(i_0_41, hypothesis, (product(X1,multiplicative_identity,X1))).
% 235.00/30.18 cnf(i_0_42, hypothesis, (product(multiplicative_identity,X1,X1))).
% 235.00/30.18 cnf(i_0_31, plain, (sum(X1,additive_inverse(X1),additive_identity))).
% 235.00/30.18 cnf(i_0_30, plain, (sum(additive_inverse(X1),X1,additive_identity))).
% 235.00/30.18 cnf(i_0_29, plain, (sum(X1,X2,add(X1,X2)))).
% 235.00/30.18 cnf(i_0_28, plain, (product(X1,X2,multiply(X1,X2)))).
% 235.00/30.18 cnf(i_0_50, negated_conjecture, (~sum(l,n,additive_identity))).
% 235.00/30.18 cnf(i_0_43, hypothesis, (X1=additive_identity|product(X1,h(X1),multiplicative_identity))).
% 235.00/30.18 cnf(i_0_44, hypothesis, (X1=additive_identity|product(h(X1),X1,multiplicative_identity))).
% 235.00/30.18 cnf(i_0_34, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 235.00/30.18 cnf(i_0_45, hypothesis, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 235.00/30.18 cnf(i_0_39, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))).
% 235.00/30.18 cnf(i_0_40, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 235.00/30.18 cnf(i_0_33, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))).
% 235.00/30.18 cnf(i_0_32, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))).
% 235.00/30.18 cnf(i_0_36, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 235.00/30.18 cnf(i_0_35, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 235.00/30.18 cnf(i_0_37, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))).
% 235.00/30.18 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))).
% 235.00/30.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 235.00/30.18 # Begin printing tableau
% 235.00/30.18 # Found 10 steps
% 235.00/30.18 cnf(i_0_47, negated_conjecture, (product(d,a,additive_identity)), inference(start_rule)).
% 235.00/30.18 cnf(i_0_52, plain, (product(d,a,additive_identity)), inference(extension_rule, [i_0_35])).
% 235.00/30.18 cnf(i_0_124, plain, (~product(multiplicative_identity,a,a)), inference(closure_rule, [i_0_42])).
% 235.00/30.18 cnf(i_0_122, plain, (product(d,a,additive_identity)), inference(extension_rule, [i_0_45])).
% 235.00/30.18 cnf(i_0_125, plain, (~product(d,multiplicative_identity,d)), inference(closure_rule, [i_0_41])).
% 235.00/30.18 cnf(i_0_1768018, plain, (product(a,d,additive_identity)), inference(extension_rule, [i_0_37])).
% 235.00/30.18 cnf(i_0_1849028, plain, (sum(l,n,additive_identity)), inference(closure_rule, [i_0_50])).
% 235.00/30.18 cnf(i_0_1849030, plain, (~product(a,c,n)), inference(closure_rule, [i_0_1768028])).
% 235.00/30.18 cnf(i_0_1849031, plain, (~product(a,b,l)), inference(closure_rule, [i_0_1768029])).
% 235.00/30.18 cnf(i_0_1849032, plain, (~sum(b,c,d)), inference(closure_rule, [i_0_46])).
% 235.00/30.18 # End printing tableau
% 235.00/30.18 # SZS output end
% 235.00/30.18 # Branches closed with saturation will be marked with an "s"
% 235.00/30.18 # Child (1879) has found a proof.
% 235.00/30.18
% 235.00/30.18 # Proof search is over...
% 235.00/30.18 # Freeing feature tree
%------------------------------------------------------------------------------