TSTP Solution File: SYN011-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN011-1 : TPTP v8.1.2. Released v1.1.0.
% 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 20:12:19 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 7 unt; 6 nHn; 23 RR)
% Number of literals : 43 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 8 ( 7 usr; 8 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( ~ n
| ~ t ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_1) ).
cnf(clause_8,negated_conjecture,
t,
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_8) ).
cnf(clause_2,negated_conjecture,
( m
| q
| n ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_2) ).
cnf(clause_4,negated_conjecture,
( l
| ~ q ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_4) ).
cnf(clause_3,negated_conjecture,
( l
| ~ m ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_3) ).
cnf(clause_6,negated_conjecture,
( r
| p
| n ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( ~ r
| ~ l ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_7) ).
cnf(clause_5,negated_conjecture,
( ~ l
| ~ p ),
file('/export/starexec/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p',clause_5) ).
cnf(c_0_8,negated_conjecture,
( ~ n
| ~ t ),
clause_1 ).
cnf(c_0_9,negated_conjecture,
t,
clause_8 ).
cnf(c_0_10,negated_conjecture,
( m
| q
| n ),
clause_2 ).
cnf(c_0_11,negated_conjecture,
~ n,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
( l
| ~ q ),
clause_4 ).
cnf(c_0_13,negated_conjecture,
( q
| m ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( l
| ~ m ),
clause_3 ).
cnf(c_0_15,negated_conjecture,
( r
| p
| n ),
clause_6 ).
cnf(c_0_16,negated_conjecture,
( ~ r
| ~ l ),
clause_7 ).
cnf(c_0_17,negated_conjecture,
l,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ l
| ~ p ),
clause_5 ).
cnf(c_0_19,negated_conjecture,
( r
| p ),
inference(sr,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
~ r,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
~ p,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN011-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14 % 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.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 19:04:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Ak3E49vS0r/E---3.1_12941.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 13020 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 13025 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 8
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 20
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 19
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 4
% 0.20/0.49 # Generated clauses : 3
% 0.20/0.49 # ...of the previous two non-redundant : 5
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 2
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 6
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 13
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 7
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 7
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 96
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.000 s
% 0.20/0.49 # Total time : 0.003 s
% 0.20/0.49 # Maximum resident set size: 1636 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1664 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------