TSTP Solution File: GRP141-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP141-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:38:59 EDT 2023
% Result : Timeout 0.28s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 12 RR)
% Number of literals : 21 ( 20 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax_glb1d_1,hypothesis,
least_upper_bound(a,c) = a,
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',ax_glb1d_1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',symmetry_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',glb_absorbtion) ).
cnf(ax_glb1d_2,hypothesis,
least_upper_bound(b,c) = b,
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',ax_glb1d_2) ).
cnf(prove_ax_glb1d,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',prove_ax_glb1d) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',symmetry_of_glb) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p',associativity_of_glb) ).
cnf(c_0_7,hypothesis,
least_upper_bound(a,c) = a,
ax_glb1d_1 ).
cnf(c_0_8,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_9,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_10,hypothesis,
least_upper_bound(c,a) = a,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
least_upper_bound(b,c) = b,
ax_glb1d_2 ).
cnf(c_0_12,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
prove_ax_glb1d ).
cnf(c_0_13,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_14,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_15,hypothesis,
greatest_lower_bound(c,a) = c,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,hypothesis,
least_upper_bound(c,b) = b,
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
greatest_lower_bound(c,greatest_lower_bound(a,b)) != c,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
greatest_lower_bound(c,greatest_lower_bound(a,X1)) = greatest_lower_bound(c,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
greatest_lower_bound(c,b) = c,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GRP141-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:40:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.CIfRshG0gx/E---3.1_11455.p
% 0.28/300.12 # Version: 3.1pre001
% 0.28/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.12 # Starting sh5l with 300s (1) cores
% 0.28/300.12 # new_bool_1 with pid 11535 completed with status 0
% 0.28/300.12 # Result found by new_bool_1
% 0.28/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.12 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.28/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.28/300.12 # SAT001_MinMin_p005000_rr_RG with pid 11540 completed with status 0
% 0.28/300.12 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.28/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.12 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.28/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.28/300.12 # Preprocessing time : 0.001 s
% 0.28/300.12 # Presaturation interreduction done
% 0.28/300.12
% 0.28/300.12 # Proof found!
% 0.28/300.12 # SZS status Unsatisfiable
% 0.28/300.12 # SZS output start CNFRefutation
% See solution above
% 0.28/300.12 # Parsed axioms : 18
% 0.28/300.12 # Removed by relevancy pruning/SinE : 2
% 0.28/300.12 # Initial clauses : 16
% 0.28/300.12 # Removed in clause preprocessing : 0
% 0.28/300.12 # Initial clauses in saturation : 16
% 0.28/300.12 # Processed clauses : 36
% 0.28/300.12 # ...of these trivial : 0
% 0.28/300.12 # ...subsumed : 0
% 0.28/300.12 # ...remaining for further processing : 36
% 0.28/300.12 # Other redundant clauses eliminated : 0
% 0.28/300.12 # Clauses deleted for lack of memory : 0
% 0.28/300.12 # Backward-subsumed : 0
% 0.28/300.12 # Backward-rewritten : 4
% 0.28/300.12 # Generated clauses : 58
% 0.28/300.12 # ...of the previous two non-redundant : 38
% 0.28/300.12 # ...aggressively subsumed : 0
% 0.28/300.12 # Contextual simplify-reflections : 0
% 0.28/300.12 # Paramodulations : 58
% 0.28/300.12 # Factorizations : 0
% 0.28/300.12 # NegExts : 0
% 0.28/300.12 # Equation resolutions : 0
% 0.28/300.12 # Total rewrite steps : 44
% 0.28/300.12 # Propositional unsat checks : 0
% 0.28/300.12 # Propositional check models : 0
% 0.28/300.12 # Propositional check unsatisfiable : 0
% 0.28/300.12 # Propositional clauses : 0
% 0.28/300.12 # Propositional clauses after purity: 0
% 0.28/300.12 # Propositional unsat core size : 0
% 0.28/300.12 # Propositional preprocessing time : 0.000
% 0.28/300.12 # Propositional encoding time : 0.000
% 0.28/300.12 # Propositional solver time : 0.000
% 0.28/300.12 # Success case prop preproc time : 0.000
% 0.28/300.12 # Success case prop encoding time : 0.000
% 0.28/300.12 # Success case prop solver time : 0.000
% 0.28/300.12 # Current number of processed clauses : 16
% 0.28/300.12 # Positive orientable unit clauses : 14
% 0.28/300.12 # Positive unorientable unit clauses: 2
% 0.28/300.12 # Negative unit clauses : 0
% 0.28/300.12 # Non-unit-clauses : 0
% 0.28/300.12 # Current number of unprocessed clauses: 34
% 0.28/300.12 # ...number of literals in the above : 34
% 0.28/300.12 # Current number of archived formulas : 0
% 0.28/300.12 # Current number of archived clauses : 20
% 0.28/300.12 # Clause-clause subsumption calls (NU) : 0
% 0.28/300.12 # Rec. Clause-clause subsumption calls : 0
% 0.28/300.12 # Non-unit clause-clause subsumptions : 0
% 0.28/300.12 # Unit Clause-clause subsumption calls : 0
% 0.28/300.12 # Rewrite failures with RHS unbound : 0
% 0.28/300.12 # BW rewrite match attempts : 41
% 0.28/300.12 # BW rewrite match successes : 33
% 0.28/300.12 # Condensation attempts : 0
% 0.28/300.12 # Condensation successes : 0
% 0.28/300.12 # Termbank termtop insertions : 663
% 0.28/300.12
% 0.28/300.12 # -------------------------------------------------
% 0.28/300.12 # User time : 0.003 s
% 0.28/300.12 # System time : 0.001 s
% 0.28/300.12 # Total time : 0.004 s
% 0.28/300.12 # Maximum resident set size: 1432 pages
% 0.28/300.12
% 0.28/300.12 # -------------------------------------------------
% 0.28/300.12 # User time : 0.004 s
% 0.28/300.12 # System time : 0.002 s
% 0.28/300.12 # Total time : 0.006 s
% 0.28/300.12 # Maximum resident set size: 1676 pages
% 0.28/300.12 % E---3.1 exiting
% 0.28/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------