TSTP Solution File: LAT389-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT389-1 : TPTP v8.1.0. Released v4.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 : 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 : Sun Jul 17 04:51:57 EDT 2022
% Result : Unsatisfiable 16.47s 8.50s
% Output : CNFRefutation 16.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT389-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/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.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 29 21:49:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 2 Number of unprocessed: 2
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 2 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 2 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 2 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 8 tableaux to operate on
% 16.47/8.50 # There were 1 total branch saturation attempts.
% 16.47/8.50 # There were 0 of these attempts blocked.
% 16.47/8.50 # There were 0 deferred branch saturation attempts.
% 16.47/8.50 # There were 0 free duplicated saturations.
% 16.47/8.50 # There were 1 total successful branch saturations.
% 16.47/8.50 # There were 0 successful branch saturations in interreduction.
% 16.47/8.50 # There were 0 successful branch saturations on the branch.
% 16.47/8.50 # There were 1 successful branch saturations after the branch.
% 16.47/8.50 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.47/8.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.47/8.50 # Begin clausification derivation
% 16.47/8.50
% 16.47/8.50 # End clausification derivation
% 16.47/8.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 16.47/8.50 cnf(i_0_4, negated_conjecture, (mult(a,plus(b,plus(a,c)))!=a)).
% 16.47/8.50 cnf(i_0_3, plain, (mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3)))=X2)).
% 16.47/8.50 cnf(i_0_6, plain, (X9=X9)).
% 16.47/8.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 16.47/8.50 # Begin printing tableau
% 16.47/8.50 # Found 6 steps
% 16.47/8.50 cnf(i_0_6, plain, (X8=X8), inference(start_rule)).
% 16.47/8.50 cnf(i_0_14, plain, (X8=X8), inference(extension_rule, [i_0_10])).
% 16.47/8.50 cnf(i_0_115, plain, ($false), inference(closure_rule, [i_0_6])).
% 16.47/8.50 cnf(i_0_113, plain, (plus(X8,X7)=plus(X8,X7)), inference(extension_rule, [i_0_11])).
% 16.47/8.50 cnf(i_0_166, plain, ($false), inference(closure_rule, [i_0_6])).
% 16.47/8.50 cnf(i_0_164, plain, (mult(plus(X8,X7),X6)=mult(plus(X8,X7),X6)), inference(etableau_closure_rule, [i_0_164, ...])).
% 16.47/8.50 # End printing tableau
% 16.47/8.50 # SZS output end
% 16.47/8.50 # Branches closed with saturation will be marked with an "s"
% 16.50/8.52 # Child (30729) has found a proof.
% 16.50/8.52
% 16.50/8.52 # Proof search is over...
% 16.50/8.52 # Freeing feature tree
%------------------------------------------------------------------------------