TSTP Solution File: SWV882-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV882-1 : TPTP v8.1.2. Released v4.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 19:55:33 EDT 2023
% Result : Unsatisfiable 0.33s 0.62s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_6,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
file('/export/starexec/sandbox/tmp/tmp.j2r4xE2ENP/E---3.1_1738.p',cls_conjecture_6) ).
cnf(cls_assms_I1_J_0,axiom,
( hBOOL(hAPP(hAPP(v_P,X1),X2))
| ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool)) ),
file('/export/starexec/sandbox/tmp/tmp.j2r4xE2ENP/E---3.1_1738.p',cls_assms_I1_J_0) ).
cnf(cls_insert__subset_2,axiom,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.j2r4xE2ENP/E---3.1_1738.p',cls_insert__subset_2) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
file('/export/starexec/sandbox/tmp/tmp.j2r4xE2ENP/E---3.1_1738.p',cls_conjecture_5) ).
cnf(cls_empty__subsetI_0,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.j2r4xE2ENP/E---3.1_1738.p',cls_empty__subsetI_0) ).
cnf(c_0_5,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
cls_conjecture_6 ).
cnf(c_0_6,axiom,
( hBOOL(hAPP(hAPP(v_P,X1),X2))
| ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool)) ),
cls_assms_I1_J_0 ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),v_G,tc_fun(t_a,tc_bool)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ c_in(X1,X4,X3) ),
cls_insert__subset_2 ).
cnf(c_0_9,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
cls_conjecture_5 ).
cnf(c_0_10,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
cls_empty__subsetI_0 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWV882-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 03:46:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.j2r4xE2ENP/E---3.1_1738.p
% 0.33/0.62 # Version: 3.1pre001
% 0.33/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.33/0.62 # Starting sh5l with 300s (1) cores
% 0.33/0.62 # new_bool_3 with pid 1822 completed with status 0
% 0.33/0.62 # Result found by new_bool_3
% 0.33/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.62 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.33/0.62 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.62 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.33/0.62 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 1827 completed with status 0
% 0.33/0.62 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.33/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.62 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.33/0.62 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.62 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.33/0.62 # Preprocessing time : 0.026 s
% 0.33/0.62
% 0.33/0.62 # Proof found!
% 0.33/0.62 # SZS status Unsatisfiable
% 0.33/0.62 # SZS output start CNFRefutation
% See solution above
% 0.33/0.62 # Parsed axioms : 627
% 0.33/0.62 # Removed by relevancy pruning/SinE : 288
% 0.33/0.62 # Initial clauses : 339
% 0.33/0.62 # Removed in clause preprocessing : 0
% 0.33/0.62 # Initial clauses in saturation : 339
% 0.33/0.62 # Processed clauses : 379
% 0.33/0.62 # ...of these trivial : 22
% 0.33/0.62 # ...subsumed : 78
% 0.33/0.62 # ...remaining for further processing : 279
% 0.33/0.62 # Other redundant clauses eliminated : 2
% 0.33/0.62 # Clauses deleted for lack of memory : 0
% 0.33/0.62 # Backward-subsumed : 4
% 0.33/0.62 # Backward-rewritten : 8
% 0.33/0.62 # Generated clauses : 3720
% 0.33/0.62 # ...of the previous two non-redundant : 3131
% 0.33/0.62 # ...aggressively subsumed : 0
% 0.33/0.62 # Contextual simplify-reflections : 4
% 0.33/0.62 # Paramodulations : 3706
% 0.33/0.62 # Factorizations : 4
% 0.33/0.62 # NegExts : 0
% 0.33/0.62 # Equation resolutions : 10
% 0.33/0.62 # Total rewrite steps : 1181
% 0.33/0.62 # Propositional unsat checks : 0
% 0.33/0.62 # Propositional check models : 0
% 0.33/0.62 # Propositional check unsatisfiable : 0
% 0.33/0.62 # Propositional clauses : 0
% 0.33/0.62 # Propositional clauses after purity: 0
% 0.33/0.62 # Propositional unsat core size : 0
% 0.33/0.62 # Propositional preprocessing time : 0.000
% 0.33/0.62 # Propositional encoding time : 0.000
% 0.33/0.62 # Propositional solver time : 0.000
% 0.33/0.62 # Success case prop preproc time : 0.000
% 0.33/0.62 # Success case prop encoding time : 0.000
% 0.33/0.62 # Success case prop solver time : 0.000
% 0.33/0.62 # Current number of processed clauses : 267
% 0.33/0.62 # Positive orientable unit clauses : 57
% 0.33/0.62 # Positive unorientable unit clauses: 8
% 0.33/0.62 # Negative unit clauses : 19
% 0.33/0.62 # Non-unit-clauses : 183
% 0.33/0.62 # Current number of unprocessed clauses: 3082
% 0.33/0.62 # ...number of literals in the above : 7875
% 0.33/0.62 # Current number of archived formulas : 0
% 0.33/0.62 # Current number of archived clauses : 12
% 0.33/0.62 # Clause-clause subsumption calls (NU) : 2762
% 0.33/0.62 # Rec. Clause-clause subsumption calls : 2425
% 0.33/0.62 # Non-unit clause-clause subsumptions : 63
% 0.33/0.62 # Unit Clause-clause subsumption calls : 404
% 0.33/0.62 # Rewrite failures with RHS unbound : 34
% 0.33/0.62 # BW rewrite match attempts : 196
% 0.33/0.62 # BW rewrite match successes : 40
% 0.33/0.62 # Condensation attempts : 0
% 0.33/0.62 # Condensation successes : 0
% 0.33/0.62 # Termbank termtop insertions : 60357
% 0.33/0.62
% 0.33/0.62 # -------------------------------------------------
% 0.33/0.62 # User time : 0.097 s
% 0.33/0.63 # System time : 0.010 s
% 0.33/0.63 # Total time : 0.107 s
% 0.33/0.63 # Maximum resident set size: 2564 pages
% 0.33/0.63
% 0.33/0.63 # -------------------------------------------------
% 0.33/0.63 # User time : 0.111 s
% 0.33/0.63 # System time : 0.012 s
% 0.33/0.63 # Total time : 0.124 s
% 0.33/0.63 # Maximum resident set size: 2124 pages
% 0.33/0.63 % E---3.1 exiting
% 1.18/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------