TSTP Solution File: GRP148-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP148-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:00 EDT 2023
% Result : Unsatisfiable 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 10 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 : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax_lub1c_2,hypothesis,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',ax_lub1c_2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',symmetry_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',glb_absorbtion) ).
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.ei0uEt68qT/E---3.1_14317.p',associativity_of_lub) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',symmetry_of_glb) ).
cnf(ax_lub1c_1,hypothesis,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',ax_lub1c_1) ).
cnf(prove_ax_lub1c,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/tmp/tmp.ei0uEt68qT/E---3.1_14317.p',prove_ax_lub1c) ).
cnf(c_0_7,hypothesis,
least_upper_bound(b,c) = c,
ax_lub1c_2 ).
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,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_11,hypothesis,
least_upper_bound(c,b) = c,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,hypothesis,
least_upper_bound(c,least_upper_bound(b,X1)) = least_upper_bound(c,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_15,hypothesis,
least_upper_bound(a,c) = c,
ax_lub1c_1 ).
cnf(c_0_16,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
prove_ax_lub1c ).
cnf(c_0_17,hypothesis,
greatest_lower_bound(least_upper_bound(c,X1),least_upper_bound(b,X1)) = least_upper_bound(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,hypothesis,
least_upper_bound(c,a) = c,
inference(rw,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_19,negated_conjecture,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_8]),c_0_8]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:09:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/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.ei0uEt68qT/E---3.1_14317.p
% 0.22/0.55 # Version: 3.1pre001
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # new_bool_1 with pid 14403 completed with status 0
% 0.22/0.55 # Result found by new_bool_1
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.55 # SAT001_MinMin_p005000_rr_RG with pid 14411 completed with status 0
% 0.22/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.55 # Preprocessing time : 0.001 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Unsatisfiable
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 18
% 0.22/0.55 # Removed by relevancy pruning/SinE : 2
% 0.22/0.55 # Initial clauses : 16
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 16
% 0.22/0.55 # Processed clauses : 251
% 0.22/0.55 # ...of these trivial : 94
% 0.22/0.55 # ...subsumed : 61
% 0.22/0.55 # ...remaining for further processing : 95
% 0.22/0.55 # Other redundant clauses eliminated : 0
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 0
% 0.22/0.55 # Backward-rewritten : 5
% 0.22/0.55 # Generated clauses : 2572
% 0.22/0.55 # ...of the previous two non-redundant : 1253
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 2572
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 0
% 0.22/0.55 # Total rewrite steps : 2826
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 74
% 0.22/0.55 # Positive orientable unit clauses : 67
% 0.22/0.55 # Positive unorientable unit clauses: 6
% 0.22/0.55 # Negative unit clauses : 1
% 0.22/0.55 # Non-unit-clauses : 0
% 0.22/0.55 # Current number of unprocessed clauses: 1030
% 0.22/0.55 # ...number of literals in the above : 1030
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 21
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.55 # Non-unit clause-clause subsumptions : 0
% 0.22/0.55 # Unit Clause-clause subsumption calls : 16
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 211
% 0.22/0.55 # BW rewrite match successes : 150
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 18953
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.019 s
% 0.22/0.55 # System time : 0.005 s
% 0.22/0.55 # Total time : 0.024 s
% 0.22/0.55 # Maximum resident set size: 1620 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.021 s
% 0.22/0.55 # System time : 0.007 s
% 0.22/0.55 # Total time : 0.027 s
% 0.22/0.55 # Maximum resident set size: 1672 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------