TSTP Solution File: LAT011-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT011-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 18:07:21 EDT 2023
% Result : Unsatisfiable 1.15s 0.63s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',absorption2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',associativity_of_meet) ).
cnf(absorption2_2,axiom,
join(X1,meet2(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',absorption2_2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',commutativity_of_meet) ).
cnf(commutativity_of_meet2,axiom,
meet2(X1,X2) = meet2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',commutativity_of_meet2) ).
cnf(absorption1_2,axiom,
meet2(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',absorption1_2) ).
cnf(associativity_of_meet2,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',associativity_of_meet2) ).
cnf(prove_meets_are_same,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/tmp/tmp.zYva7YfkM4/E---3.1_16827.p',prove_meets_are_same) ).
cnf(c_0_10,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
join(X1,meet2(X1,X2)) = X1,
absorption2_2 ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,axiom,
meet2(X1,X2) = meet2(X2,X1),
commutativity_of_meet2 ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
meet(X1,meet2(X1,X2)) = meet2(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
join(X1,meet2(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,axiom,
meet2(X1,join(X1,X2)) = X1,
absorption1_2 ).
cnf(c_0_22,plain,
join(meet(X1,X2),meet(X1,meet2(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
meet(X1,meet2(X2,X1)) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16]) ).
cnf(c_0_24,plain,
meet2(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_26,plain,
join(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).
cnf(c_0_27,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
associativity_of_meet2 ).
cnf(c_0_28,plain,
meet2(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_17]) ).
cnf(c_0_29,plain,
meet2(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
meet(a,b) != meet2(a,b),
prove_meets_are_same ).
cnf(c_0_31,plain,
meet(X1,X2) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LAT011-1 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Mon Oct 2 10:17:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.zYva7YfkM4/E---3.1_16827.p
% 1.15/0.63 # Version: 3.1pre001
% 1.15/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.15/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.15/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.15/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.15/0.63 # Starting sh5l with 300s (1) cores
% 1.15/0.63 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16950 completed with status 0
% 1.15/0.63 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.15/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.15/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.15/0.63 # No SInE strategy applied
% 1.15/0.63 # Search class: FUUPM-FFSF22-SFFFFFNN
% 1.15/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.15/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.15/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.15/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.15/0.63 # Starting new_bool_1 with 136s (1) cores
% 1.15/0.63 # Starting sh5l with 136s (1) cores
% 1.15/0.63 # SAT001_MinMin_p005000_rr_RG with pid 16956 completed with status 0
% 1.15/0.63 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.15/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.15/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.15/0.63 # No SInE strategy applied
% 1.15/0.63 # Search class: FUUPM-FFSF22-SFFFFFNN
% 1.15/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.15/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.15/0.63 # Preprocessing time : 0.001 s
% 1.15/0.63 # Presaturation interreduction done
% 1.15/0.63
% 1.15/0.63 # Proof found!
% 1.15/0.63 # SZS status Unsatisfiable
% 1.15/0.63 # SZS output start CNFRefutation
% See solution above
% 1.15/0.63 # Parsed axioms : 14
% 1.15/0.63 # Removed by relevancy pruning/SinE : 0
% 1.15/0.63 # Initial clauses : 14
% 1.15/0.63 # Removed in clause preprocessing : 0
% 1.15/0.63 # Initial clauses in saturation : 14
% 1.15/0.63 # Processed clauses : 857
% 1.15/0.63 # ...of these trivial : 207
% 1.15/0.63 # ...subsumed : 474
% 1.15/0.63 # ...remaining for further processing : 176
% 1.15/0.63 # Other redundant clauses eliminated : 0
% 1.15/0.63 # Clauses deleted for lack of memory : 0
% 1.15/0.63 # Backward-subsumed : 0
% 1.15/0.63 # Backward-rewritten : 101
% 1.15/0.63 # Generated clauses : 15255
% 1.15/0.63 # ...of the previous two non-redundant : 8227
% 1.15/0.63 # ...aggressively subsumed : 0
% 1.15/0.63 # Contextual simplify-reflections : 0
% 1.15/0.63 # Paramodulations : 15255
% 1.15/0.63 # Factorizations : 0
% 1.15/0.63 # NegExts : 0
% 1.15/0.63 # Equation resolutions : 0
% 1.15/0.63 # Total rewrite steps : 17940
% 1.15/0.63 # Propositional unsat checks : 0
% 1.15/0.63 # Propositional check models : 0
% 1.15/0.63 # Propositional check unsatisfiable : 0
% 1.15/0.63 # Propositional clauses : 0
% 1.15/0.63 # Propositional clauses after purity: 0
% 1.15/0.63 # Propositional unsat core size : 0
% 1.15/0.63 # Propositional preprocessing time : 0.000
% 1.15/0.63 # Propositional encoding time : 0.000
% 1.15/0.63 # Propositional solver time : 0.000
% 1.15/0.63 # Success case prop preproc time : 0.000
% 1.15/0.63 # Success case prop encoding time : 0.000
% 1.15/0.63 # Success case prop solver time : 0.000
% 1.15/0.63 # Current number of processed clauses : 61
% 1.15/0.63 # Positive orientable unit clauses : 54
% 1.15/0.63 # Positive unorientable unit clauses: 7
% 1.15/0.63 # Negative unit clauses : 0
% 1.15/0.63 # Non-unit-clauses : 0
% 1.15/0.63 # Current number of unprocessed clauses: 7368
% 1.15/0.63 # ...number of literals in the above : 7368
% 1.15/0.63 # Current number of archived formulas : 0
% 1.15/0.63 # Current number of archived clauses : 115
% 1.15/0.63 # Clause-clause subsumption calls (NU) : 0
% 1.15/0.63 # Rec. Clause-clause subsumption calls : 0
% 1.15/0.63 # Non-unit clause-clause subsumptions : 0
% 1.15/0.63 # Unit Clause-clause subsumption calls : 51
% 1.15/0.63 # Rewrite failures with RHS unbound : 0
% 1.15/0.63 # BW rewrite match attempts : 501
% 1.15/0.63 # BW rewrite match successes : 315
% 1.15/0.63 # Condensation attempts : 0
% 1.15/0.63 # Condensation successes : 0
% 1.15/0.63 # Termbank termtop insertions : 105409
% 1.15/0.63
% 1.15/0.63 # -------------------------------------------------
% 1.15/0.63 # User time : 0.123 s
% 1.15/0.63 # System time : 0.010 s
% 1.15/0.63 # Total time : 0.132 s
% 1.15/0.63 # Maximum resident set size: 1516 pages
% 1.15/0.63
% 1.15/0.63 # -------------------------------------------------
% 1.15/0.63 # User time : 0.614 s
% 1.15/0.63 # System time : 0.022 s
% 1.15/0.63 # Total time : 0.636 s
% 1.15/0.63 # Maximum resident set size: 1672 pages
% 1.15/0.63 % E---3.1 exiting
% 1.15/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------