TSTP Solution File: GRP144-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP144-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:46:21 EDT 2023
% Result : Unsatisfiable 408.32s 136.51s
% Output : CNFRefutation 408.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 8 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ax_glb3a,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),b) != b,
file('/export/starexec/sandbox2/tmp/tmp.pWZ7uUFopj/E---3.1_24159.p',prove_ax_glb3a) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.pWZ7uUFopj/E---3.1_24159.p',symmetry_of_glb) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.pWZ7uUFopj/E---3.1_24159.p',symmetry_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pWZ7uUFopj/E---3.1_24159.p',lub_absorbtion) ).
cnf(c_0_4,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),b) != b,
prove_ax_glb3a ).
cnf(c_0_5,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
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,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP144-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.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.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:47:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.pWZ7uUFopj/E---3.1_24159.p
% 408.32/136.51 # Version: 3.1pre001
% 408.32/136.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.32/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.32/136.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.32/136.51 # Starting new_bool_3 with 300s (1) cores
% 408.32/136.51 # Starting new_bool_1 with 300s (1) cores
% 408.32/136.51 # Starting sh5l with 300s (1) cores
% 408.32/136.51 # new_bool_1 with pid 24238 completed with status 0
% 408.32/136.51 # Result found by new_bool_1
% 408.32/136.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.32/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.32/136.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.32/136.51 # Starting new_bool_3 with 300s (1) cores
% 408.32/136.51 # Starting new_bool_1 with 300s (1) cores
% 408.32/136.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.32/136.51 # Search class: FUUPM-FFSF22-SFFFFFNN
% 408.32/136.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.32/136.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.32/136.51 # SAT001_MinMin_p005000_rr_RG with pid 24240 completed with status 0
% 408.32/136.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.32/136.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.32/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.32/136.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.32/136.51 # Starting new_bool_3 with 300s (1) cores
% 408.32/136.51 # Starting new_bool_1 with 300s (1) cores
% 408.32/136.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.32/136.51 # Search class: FUUPM-FFSF22-SFFFFFNN
% 408.32/136.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.32/136.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.32/136.51 # Preprocessing time : 0.001 s
% 408.32/136.51 # Presaturation interreduction done
% 408.32/136.51
% 408.32/136.51 # Proof found!
% 408.32/136.51 # SZS status Unsatisfiable
% 408.32/136.51 # SZS output start CNFRefutation
% See solution above
% 408.32/136.51 # Parsed axioms : 16
% 408.32/136.51 # Removed by relevancy pruning/SinE : 2
% 408.32/136.51 # Initial clauses : 14
% 408.32/136.51 # Removed in clause preprocessing : 0
% 408.32/136.51 # Initial clauses in saturation : 14
% 408.32/136.51 # Processed clauses : 8
% 408.32/136.51 # ...of these trivial : 0
% 408.32/136.51 # ...subsumed : 0
% 408.32/136.51 # ...remaining for further processing : 7
% 408.32/136.51 # Other redundant clauses eliminated : 0
% 408.32/136.51 # Clauses deleted for lack of memory : 0
% 408.32/136.51 # Backward-subsumed : 0
% 408.32/136.51 # Backward-rewritten : 1
% 408.32/136.51 # Generated clauses : 0
% 408.32/136.51 # ...of the previous two non-redundant : 1
% 408.32/136.51 # ...aggressively subsumed : 0
% 408.32/136.51 # Contextual simplify-reflections : 0
% 408.32/136.51 # Paramodulations : 0
% 408.32/136.51 # Factorizations : 0
% 408.32/136.51 # NegExts : 0
% 408.32/136.51 # Equation resolutions : 0
% 408.32/136.51 # Total rewrite steps : 3
% 408.32/136.51 # Propositional unsat checks : 0
% 408.32/136.51 # Propositional check models : 0
% 408.32/136.51 # Propositional check unsatisfiable : 0
% 408.32/136.51 # Propositional clauses : 0
% 408.32/136.51 # Propositional clauses after purity: 0
% 408.32/136.51 # Propositional unsat core size : 0
% 408.32/136.51 # Propositional preprocessing time : 0.000
% 408.32/136.51 # Propositional encoding time : 0.000
% 408.32/136.51 # Propositional solver time : 0.000
% 408.32/136.51 # Success case prop preproc time : 0.000
% 408.32/136.51 # Success case prop encoding time : 0.000
% 408.32/136.51 # Success case prop solver time : 0.000
% 408.32/136.51 # Current number of processed clauses : 6
% 408.32/136.51 # Positive orientable unit clauses : 4
% 408.32/136.51 # Positive unorientable unit clauses: 2
% 408.32/136.51 # Negative unit clauses : 0
% 408.32/136.51 # Non-unit-clauses : 0
% 408.32/136.51 # Current number of unprocessed clauses: 7
% 408.32/136.51 # ...number of literals in the above : 7
% 408.32/136.51 # Current number of archived formulas : 0
% 408.32/136.51 # Current number of archived clauses : 1
% 408.32/136.51 # Clause-clause subsumption calls (NU) : 0
% 408.32/136.51 # Rec. Clause-clause subsumption calls : 0
% 408.32/136.51 # Non-unit clause-clause subsumptions : 0
% 408.32/136.51 # Unit Clause-clause subsumption calls : 0
% 408.32/136.51 # Rewrite failures with RHS unbound : 0
% 408.32/136.51 # BW rewrite match attempts : 16
% 408.32/136.51 # BW rewrite match successes : 14
% 408.32/136.51 # Condensation attempts : 0
% 408.32/136.51 # Condensation successes : 0
% 408.32/136.51 # Termbank termtop insertions : 143
% 408.32/136.51
% 408.32/136.51 # -------------------------------------------------
% 408.32/136.51 # User time : 0.002 s
% 408.32/136.51 # System time : 0.000 s
% 408.32/136.51 # Total time : 0.002 s
% 408.32/136.51 # Maximum resident set size: 1612 pages
% 408.32/136.51
% 408.32/136.51 # -------------------------------------------------
% 408.32/136.51 # User time : 0.004 s
% 408.32/136.51 # System time : 0.002 s
% 408.32/136.51 # Total time : 0.006 s
% 408.32/136.51 # Maximum resident set size: 1676 pages
% 408.32/136.51 % E---3.1 exiting
%------------------------------------------------------------------------------