TSTP Solution File: LAT006-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT006-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:20 EDT 2023
% Result : Unsatisfiable 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 33 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 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 : 75 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.yo4bCnEWsj/E---3.1_6517.p',absorption) ).
cnf(distribution,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.yo4bCnEWsj/E---3.1_6517.p',distribution) ).
cnf(prove_associativity_of_meet,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
file('/export/starexec/sandbox/tmp/tmp.yo4bCnEWsj/E---3.1_6517.p',prove_associativity_of_meet) ).
cnf(c_0_3,axiom,
meet(X1,join(X1,X2)) = X1,
absorption ).
cnf(c_0_4,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
distribution ).
cnf(c_0_5,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_8,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_9,plain,
meet(X1,meet(X1,join(X2,X3))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]) ).
cnf(c_0_10,plain,
meet(X1,join(X2,X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_11,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
join(meet(X1,join(X2,X3)),X2) = meet(join(X2,X3),join(X2,X1)),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_15,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_18,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_5]),c_0_17]) ).
cnf(c_0_20,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_13]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_8]),c_0_13]) ).
cnf(c_0_24,plain,
meet(meet(X1,X2),meet(X3,X2)) = meet(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_25,plain,
meet(meet(X1,X2),meet(meet(X3,X2),X1)) = meet(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_16]) ).
cnf(c_0_26,plain,
meet(meet(X1,X2),join(X3,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_22]),c_0_15]) ).
cnf(c_0_27,plain,
meet(meet(X1,X2),X3) = meet(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_24]) ).
cnf(c_0_28,plain,
meet(X1,meet(meet(X1,X2),X3)) = meet(meet(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_16]) ).
cnf(c_0_29,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
prove_associativity_of_meet ).
cnf(c_0_30,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
meet(c,meet(a,b)) != meet(a,meet(b,c)),
inference(rw,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_30]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LAT006-1 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 11:03:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.yo4bCnEWsj/E---3.1_6517.p
% 0.17/0.51 # Version: 3.1pre001
% 0.17/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # new_bool_3 with pid 6596 completed with status 0
% 0.17/0.51 # Result found by new_bool_3
% 0.17/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.51 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.17/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.17/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 6600 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.17/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.51 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.17/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.17/0.51 # Preprocessing time : 0.001 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Unsatisfiable
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 3
% 0.17/0.51 # Removed by relevancy pruning/SinE : 0
% 0.17/0.51 # Initial clauses : 3
% 0.17/0.51 # Removed in clause preprocessing : 0
% 0.17/0.51 # Initial clauses in saturation : 3
% 0.17/0.51 # Processed clauses : 434
% 0.17/0.51 # ...of these trivial : 178
% 0.17/0.51 # ...subsumed : 159
% 0.17/0.51 # ...remaining for further processing : 97
% 0.17/0.51 # Other redundant clauses eliminated : 0
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 0
% 0.17/0.51 # Backward-rewritten : 39
% 0.17/0.51 # Generated clauses : 8486
% 0.17/0.51 # ...of the previous two non-redundant : 5262
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 0
% 0.17/0.51 # Paramodulations : 8486
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 0
% 0.17/0.51 # Total rewrite steps : 6095
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 55
% 0.17/0.51 # Positive orientable unit clauses : 52
% 0.17/0.51 # Positive unorientable unit clauses: 3
% 0.17/0.51 # Negative unit clauses : 0
% 0.17/0.51 # Non-unit-clauses : 0
% 0.17/0.51 # Current number of unprocessed clauses: 4768
% 0.17/0.51 # ...number of literals in the above : 4768
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 42
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.51 # Non-unit clause-clause subsumptions : 0
% 0.17/0.51 # Unit Clause-clause subsumption calls : 41
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 398
% 0.17/0.51 # BW rewrite match successes : 176
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 71320
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.062 s
% 0.17/0.51 # System time : 0.004 s
% 0.17/0.51 # Total time : 0.066 s
% 0.17/0.51 # Maximum resident set size: 1424 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.063 s
% 0.17/0.51 # System time : 0.005 s
% 0.17/0.51 # Total time : 0.068 s
% 0.17/0.51 # Maximum resident set size: 1668 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------