TSTP Solution File: LAT042-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:28 EDT 2023
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 14 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 : 25 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_modular_law,negated_conjecture,
join(a,meet(b,join(a,c))) != meet(join(a,b),join(a,c)),
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',prove_modular_law) ).
cnf(distributivity,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',distributivity) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',commutativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',idempotence_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.LXce08ufB4/E---3.1_4367.p',associativity_of_join) ).
cnf(c_0_6,negated_conjecture,
join(a,meet(b,join(a,c))) != meet(join(a,b),join(a,c)),
prove_modular_law ).
cnf(c_0_7,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
distributivity ).
cnf(c_0_8,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_9,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_10,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_11,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_12,negated_conjecture,
join(a,join(meet(a,c),meet(b,c))) != join(a,join(meet(a,b),meet(b,c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_7]),c_0_9]),c_0_10]),c_0_8]),c_0_7]),c_0_8]),c_0_8]),c_0_7]),c_0_8]) ).
cnf(c_0_13,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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 : Mon Oct 2 09:56:23 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/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.LXce08ufB4/E---3.1_4367.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4445 completed with status 0
% 0.16/0.45 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.45 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.16/0.45 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.16/0.45 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.16/0.46 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 4454 completed with status 0
% 0.16/0.46 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.16/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.46 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.16/0.46 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Unsatisfiable
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 13
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 13
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 13
% 0.16/0.46 # Processed clauses : 88
% 0.16/0.46 # ...of these trivial : 38
% 0.16/0.46 # ...subsumed : 6
% 0.16/0.46 # ...remaining for further processing : 44
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 6
% 0.16/0.46 # Generated clauses : 627
% 0.16/0.46 # ...of the previous two non-redundant : 240
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 627
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Total rewrite steps : 695
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 38
% 0.16/0.46 # Positive orientable unit clauses : 35
% 0.16/0.46 # Positive unorientable unit clauses: 3
% 0.16/0.46 # Negative unit clauses : 0
% 0.16/0.46 # Non-unit-clauses : 0
% 0.16/0.46 # Current number of unprocessed clauses: 157
% 0.16/0.46 # ...number of literals in the above : 157
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 6
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.46 # Non-unit clause-clause subsumptions : 0
% 0.16/0.46 # Unit Clause-clause subsumption calls : 1
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 66
% 0.16/0.46 # BW rewrite match successes : 45
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 3500
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.005 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.007 s
% 0.16/0.46 # Maximum resident set size: 1520 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.028 s
% 0.16/0.46 # System time : 0.010 s
% 0.16/0.46 # Total time : 0.038 s
% 0.16/0.46 # Maximum resident set size: 1680 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------