TSTP Solution File: LCL169-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL169-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:23:58 EDT 2023
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 7 RR)
% Number of literals : 14 ( 2 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(p,not(p)),not(p))),
file('/export/starexec/sandbox/tmp/tmp.EL9CWR3I5R/E---3.1_23730.p',prove_this) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.EL9CWR3I5R/E---3.1_23730.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.EL9CWR3I5R/E---3.1_23730.p',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.EL9CWR3I5R/E---3.1_23730.p',axiom_1_2) ).
cnf(c_0_4,negated_conjecture,
~ theorem(implies(implies(p,not(p)),not(p))),
prove_this ).
cnf(c_0_5,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_6,negated_conjecture,
~ theorem(or(not(or(not(p),not(p))),not(p))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_7,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_8,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_9,negated_conjecture,
~ axiom(or(not(or(not(p),not(p))),not(p))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : LCL169-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 13:04:07 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.EL9CWR3I5R/E---3.1_23730.p
% 0.15/0.40 # Version: 3.1pre001
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23807 completed with status 0
% 0.15/0.40 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # No SInE strategy applied
% 0.15/0.40 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.40 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.40 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/0.40 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 23818 completed with status 0
% 0.15/0.40 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # No SInE strategy applied
% 0.15/0.40 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.40 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.40 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Unsatisfiable
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 9
% 0.15/0.40 # Removed by relevancy pruning/SinE : 0
% 0.15/0.40 # Initial clauses : 9
% 0.15/0.40 # Removed in clause preprocessing : 1
% 0.15/0.40 # Initial clauses in saturation : 8
% 0.15/0.40 # Processed clauses : 17
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 0
% 0.15/0.40 # ...remaining for further processing : 17
% 0.15/0.40 # Other redundant clauses eliminated : 0
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 1
% 0.15/0.40 # Generated clauses : 7
% 0.15/0.40 # ...of the previous two non-redundant : 5
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 7
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 0
% 0.15/0.40 # Total rewrite steps : 1
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 8
% 0.15/0.40 # Positive orientable unit clauses : 2
% 0.15/0.40 # Positive unorientable unit clauses: 0
% 0.15/0.40 # Negative unit clauses : 2
% 0.15/0.40 # Non-unit-clauses : 4
% 0.15/0.40 # Current number of unprocessed clauses: 4
% 0.15/0.40 # ...number of literals in the above : 4
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 10
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 2
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 2
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 1
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 10
% 0.15/0.41 # BW rewrite match successes : 1
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 324
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.002 s
% 0.15/0.41 # System time : 0.001 s
% 0.15/0.41 # Total time : 0.003 s
% 0.15/0.41 # Maximum resident set size: 1648 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.007 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.011 s
% 0.15/0.41 # Maximum resident set size: 1680 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------