TSTP Solution File: SYN097-1.002 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN097-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:13:47 EDT 2023
% Result : Timeout 0.31s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 7 unt; 6 nHn; 21 RR)
% Number of literals : 39 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 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(u_s2_goal_1,negated_conjecture,
( u_1
| ~ p_1_2 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_s2_goal_1) ).
cnf(u_1_s2_goal_1,axiom,
~ u_1,
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_1_s2_goal_1) ).
cnf(u_12_t2_3,axiom,
( p_2_2
| ~ u_12 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_12_t2_3) ).
cnf(u_t2_3,axiom,
( u_12
| p_2_2 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_t2_3) ).
cnf(u_10_t2_1,axiom,
( p_1_1
| ~ u_10 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_10_t2_1) ).
cnf(u_t2_1,axiom,
( u_10
| p_1_1 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_t2_1) ).
cnf(u_2_s2_type11_1,axiom,
( p_1_2
| ~ u_2 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_2_s2_type11_1) ).
cnf(u_s2_type11_1,axiom,
( u_2
| p_1_2
| ~ p_2_2
| ~ p_1_1 ),
file('/export/starexec/sandbox/tmp/tmp.xbJwFT7Lbu/E---3.1_8415.p',u_s2_type11_1) ).
cnf(c_0_8,negated_conjecture,
( u_1
| ~ p_1_2 ),
u_s2_goal_1 ).
cnf(c_0_9,axiom,
~ u_1,
u_1_s2_goal_1 ).
cnf(c_0_10,axiom,
( p_2_2
| ~ u_12 ),
u_12_t2_3 ).
cnf(c_0_11,axiom,
( u_12
| p_2_2 ),
u_t2_3 ).
cnf(c_0_12,axiom,
( p_1_1
| ~ u_10 ),
u_10_t2_1 ).
cnf(c_0_13,axiom,
( u_10
| p_1_1 ),
u_t2_1 ).
cnf(c_0_14,axiom,
( p_1_2
| ~ u_2 ),
u_2_s2_type11_1 ).
cnf(c_0_15,negated_conjecture,
~ p_1_2,
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,axiom,
( u_2
| p_1_2
| ~ p_2_2
| ~ p_1_1 ),
u_s2_type11_1 ).
cnf(c_0_17,plain,
p_2_2,
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
p_1_1,
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
~ u_2,
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_15]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN097-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.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.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 18:50:16 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.xbJwFT7Lbu/E---3.1_8415.p
% 0.31/300.13 # Version: 3.1pre001
% 0.31/300.13 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.31/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.31/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.31/300.13 # Starting sh5l with 300s (1) cores
% 0.31/300.13 # sh5l with pid 8496 completed with status 0
% 0.31/300.13 # Result found by sh5l
% 0.31/300.13 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.31/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.31/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.31/300.13 # Starting sh5l with 300s (1) cores
% 0.31/300.13 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/300.13 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.31/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.31/300.13 # SAT001_MinMin_p005000_rr_RG with pid 8500 completed with status 0
% 0.31/300.13 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.31/300.13 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.31/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.31/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.31/300.13 # Starting sh5l with 300s (1) cores
% 0.31/300.13 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/300.13 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.31/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.31/300.13 # Preprocessing time : 0.001 s
% 0.31/300.13 # Presaturation interreduction done
% 0.31/300.13
% 0.31/300.13 # Proof found!
% 0.31/300.13 # SZS status Unsatisfiable
% 0.31/300.13 # SZS output start CNFRefutation
% See solution above
% 0.31/300.13 # Parsed axioms : 52
% 0.31/300.13 # Removed by relevancy pruning/SinE : 26
% 0.31/300.13 # Initial clauses : 26
% 0.31/300.13 # Removed in clause preprocessing : 0
% 0.31/300.13 # Initial clauses in saturation : 26
% 0.31/300.13 # Processed clauses : 23
% 0.31/300.13 # ...of these trivial : 4
% 0.31/300.13 # ...subsumed : 0
% 0.31/300.13 # ...remaining for further processing : 18
% 0.31/300.13 # Other redundant clauses eliminated : 0
% 0.31/300.13 # Clauses deleted for lack of memory : 0
% 0.31/300.13 # Backward-subsumed : 0
% 0.31/300.13 # Backward-rewritten : 8
% 0.31/300.13 # Generated clauses : 0
% 0.31/300.13 # ...of the previous two non-redundant : 0
% 0.31/300.13 # ...aggressively subsumed : 0
% 0.31/300.13 # Contextual simplify-reflections : 4
% 0.31/300.13 # Paramodulations : 0
% 0.31/300.13 # Factorizations : 0
% 0.31/300.13 # NegExts : 0
% 0.31/300.13 # Equation resolutions : 0
% 0.31/300.13 # Total rewrite steps : 14
% 0.31/300.13 # Propositional unsat checks : 0
% 0.31/300.13 # Propositional check models : 0
% 0.31/300.13 # Propositional check unsatisfiable : 0
% 0.31/300.13 # Propositional clauses : 0
% 0.31/300.13 # Propositional clauses after purity: 0
% 0.31/300.13 # Propositional unsat core size : 0
% 0.31/300.13 # Propositional preprocessing time : 0.000
% 0.31/300.13 # Propositional encoding time : 0.000
% 0.31/300.13 # Propositional solver time : 0.000
% 0.31/300.13 # Success case prop preproc time : 0.000
% 0.31/300.13 # Success case prop encoding time : 0.000
% 0.31/300.13 # Success case prop solver time : 0.000
% 0.31/300.13 # Current number of processed clauses : 10
% 0.31/300.13 # Positive orientable unit clauses : 4
% 0.31/300.13 # Positive unorientable unit clauses: 0
% 0.31/300.13 # Negative unit clauses : 4
% 0.31/300.13 # Non-unit-clauses : 2
% 0.31/300.13 # Current number of unprocessed clauses: 3
% 0.31/300.13 # ...number of literals in the above : 12
% 0.31/300.13 # Current number of archived formulas : 0
% 0.31/300.13 # Current number of archived clauses : 8
% 0.31/300.13 # Clause-clause subsumption calls (NU) : 12
% 0.31/300.13 # Rec. Clause-clause subsumption calls : 12
% 0.31/300.13 # Non-unit clause-clause subsumptions : 4
% 0.31/300.13 # Unit Clause-clause subsumption calls : 5
% 0.31/300.13 # Rewrite failures with RHS unbound : 0
% 0.31/300.13 # BW rewrite match attempts : 4
% 0.31/300.13 # BW rewrite match successes : 4
% 0.31/300.13 # Condensation attempts : 0
% 0.31/300.13 # Condensation successes : 0
% 0.31/300.13 # Termbank termtop insertions : 491
% 0.31/300.13
% 0.31/300.13 # -------------------------------------------------
% 0.31/300.13 # User time : 0.002 s
% 0.31/300.13 # System time : 0.001 s
% 0.31/300.13 # Total time : 0.003 s
% 0.31/300.13 # Maximum resident set size: 1644 pages
% 0.31/300.13
% 0.31/300.13 # -------------------------------------------------
% 0.31/300.13 # User time : 0.002 s
% 0.31/300.13 # System time : 0.003 s
% 0.31/300.13 # Total time : 0.005 s
% 0.31/300.13 # Maximum resident set size: 1704 pages
% 0.31/300.13 % E---3.1 exiting
% 0.31/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------