TSTP Solution File: GRP162-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP162-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:39:02 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax_transa_2,hypothesis,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p',ax_transa_2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p',symmetry_of_lub) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p',associativity_of_lub) ).
cnf(ax_transa_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p',ax_transa_1) ).
cnf(prove_ax_transa,negated_conjecture,
least_upper_bound(a,c) != c,
file('/export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p',prove_ax_transa) ).
cnf(c_0_5,hypothesis,
least_upper_bound(b,c) = c,
ax_transa_2 ).
cnf(c_0_6,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_7,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_8,hypothesis,
least_upper_bound(c,b) = c,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,hypothesis,
least_upper_bound(a,b) = b,
ax_transa_1 ).
cnf(c_0_10,negated_conjecture,
least_upper_bound(a,c) != c,
prove_ax_transa ).
cnf(c_0_11,hypothesis,
least_upper_bound(c,least_upper_bound(b,X1)) = least_upper_bound(c,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
least_upper_bound(b,a) = b,
inference(rw,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_13,negated_conjecture,
least_upper_bound(c,a) != c,
inference(rw,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_14,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GRP162-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:07:44 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ymF88xD42u/E---3.1_11212.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_1 with pid 11300 completed with status 0
% 0.20/0.51 # Result found by new_bool_1
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 11304 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 18
% 0.20/0.51 # Removed by relevancy pruning/SinE : 2
% 0.20/0.51 # Initial clauses : 16
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 16
% 0.20/0.51 # Processed clauses : 37
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 37
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 3
% 0.20/0.51 # Generated clauses : 75
% 0.20/0.51 # ...of the previous two non-redundant : 51
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 75
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 57
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 18
% 0.20/0.51 # Positive orientable unit clauses : 15
% 0.20/0.51 # Positive unorientable unit clauses: 2
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 42
% 0.20/0.51 # ...number of literals in the above : 42
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 19
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 1
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 36
% 0.20/0.51 # BW rewrite match successes : 28
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 731
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.003 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.004 s
% 0.20/0.51 # Maximum resident set size: 1620 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.007 s
% 0.20/0.51 # Maximum resident set size: 1676 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------