TSTP Solution File: LCL646+1.005 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL646+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:31:23 EDT 2022
% Result : Theorem 13.05s 13.24s
% Output : Refutation 13.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL646+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n007.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 : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 04:49:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.43/0.60 ----- Otter 3.2, August 2001 -----
% 0.43/0.60 The process was started by sandbox2 on n007.cluster.edu,
% 0.43/0.60 Sun Jul 3 04:49:55 2022
% 0.43/0.60 The command was "./sos". The process ID is 32268.
% 0.43/0.60
% 0.43/0.60 set(prolog_style_variables).
% 0.43/0.60 set(auto).
% 0.43/0.60 dependent: set(auto1).
% 0.43/0.60 dependent: set(process_input).
% 0.43/0.60 dependent: clear(print_kept).
% 0.43/0.60 dependent: clear(print_new_demod).
% 0.43/0.60 dependent: clear(print_back_demod).
% 0.43/0.60 dependent: clear(print_back_sub).
% 0.43/0.60 dependent: set(control_memory).
% 0.43/0.60 dependent: assign(max_mem, 12000).
% 0.43/0.60 dependent: assign(pick_given_ratio, 4).
% 0.43/0.60 dependent: assign(stats_level, 1).
% 0.43/0.60 dependent: assign(pick_semantic_ratio, 3).
% 0.43/0.60 dependent: assign(sos_limit, 5000).
% 0.43/0.60 dependent: assign(max_weight, 60).
% 0.43/0.60 clear(print_given).
% 0.43/0.60
% 0.43/0.60 formula_list(usable).
% 0.43/0.60
% 0.43/0.60 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.43/0.60
% 0.43/0.60 This is a non-Horn set without equality. The strategy
% 0.43/0.60 will be ordered hyper_res, ur_res, unit deletion, and
% 0.43/0.60 factoring, with satellites in sos and nuclei in usable.
% 0.43/0.60
% 0.43/0.60 dependent: set(hyper_res).
% 0.43/0.60 dependent: set(factor).
% 0.43/0.60 dependent: set(unit_deletion).
% 0.43/0.60
% 0.43/0.60 ------------> process usable:
% 0.43/0.60 Following clause subsumed by 2 during input processing: 0 [] {-} -r1($c5,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -r1(D,E)|p4(E).
% 0.43/0.60 456 back subsumes 319.
% 0.43/0.60 456 back subsumes 316.
% 0.43/0.60 456 back subsumes 271.
% 0.43/0.60 456 back subsumes 268.
% 0.43/0.60 456 back subsumes 223.
% 0.43/0.60 456 back subsumes 220.
% 0.43/0.60 457 back subsumes 419.
% 0.43/0.60 457 back subsumes 418.
% 0.43/0.60 457 back subsumes 395.
% 0.43/0.60 457 back subsumes 394.
% 0.43/0.60 457 back subsumes 377.
% 0.43/0.60 457 back subsumes 376.
% 0.43/0.60 459 back subsumes 320.
% 0.43/0.60 459 back subsumes 317.
% 0.43/0.60 459 back subsumes 272.
% 0.43/0.60 459 back subsumes 269.
% 0.43/0.60 459 back subsumes 224.
% 0.43/0.60 459 back subsumes 221.
% 0.43/0.60 463 back subsumes 461.
% 0.43/0.60 463 back subsumes 321.
% 0.43/0.60 463 back subsumes 318.
% 0.43/0.60 463 back subsumes 273.
% 0.43/0.60 463 back subsumes 270.
% 0.43/0.60 463 back subsumes 225.
% 0.43/0.60 463 back subsumes 222.
% 0.43/0.60 467 back subsumes 403.
% 0.43/0.60 467 back subsumes 400.
% 0.43/0.60 468 back subsumes 421.
% 0.43/0.60 468 back subsumes 420.
% 0.43/0.60 468 back subsumes 397.
% 0.43/0.60 468 back subsumes 396.
% 0.43/0.60 468 back subsumes 379.
% 0.43/0.60 468 back subsumes 378.
% 0.43/0.60 470 back subsumes 404.
% 0.43/0.60 470 back subsumes 401.
% 0.43/0.60 474 back subsumes 472.
% 0.43/0.60 474 back subsumes 405.
% 0.43/0.60 474 back subsumes 402.
% 0.43/0.60 478 back subsumes 325.
% 0.43/0.60 478 back subsumes 322.
% 0.43/0.60 478 back subsumes 277.
% 0.43/0.60 478 back subsumes 274.
% 0.43/0.60 478 back subsumes 229.
% 0.43/0.60 478 back subsumes 226.
% 0.43/0.60 479 back subsumes 423.
% 0.43/0.60 479 back subsumes 422.
% 0.43/0.60 479 back subsumes 399.
% 0.43/0.60 479 back subsumes 398.
% 0.43/0.60 479 back subsumes 381.
% 0.43/0.60 479 back subsumes 380.
% 0.43/0.60 481 back subsumes 326.
% 0.43/0.60 481 back subsumes 323.
% 0.43/0.60 481 back subsumes 278.
% 0.43/0.60 481 back subsumes 275.
% 0.43/0.60 481 back subsumes 230.
% 0.43/0.60 481 back subsumes 227.
% 0.43/0.60 485 back subsumes 483.
% 0.43/0.60 485 back subsumes 327.
% 0.43/0.60 485 back subsumes 324.
% 0.43/0.60 485 back subsumes 279.
% 0.43/0.60 485 back subsumes 276.
% 0.43/0.60 485 back subsumes 231.
% 0.43/0.60 485 back subsumes 228.
% 0.43/0.60
% 0.43/0.60 ------------> process sos:
% 0.43/0.60
% 0.43/0.60 ======= end of input processing =======
% 1.53/1.74
% 1.53/1.74 Model 1 (0.00 seconds, 0 Inserts)
% 1.53/1.74
% 1.53/1.74 Stopped by limit on number of solutions
% 1.53/1.74
% 1.53/1.74
% 1.53/1.74 -------------- Softie stats --------------
% 1.53/1.74
% 1.53/1.74 UPDATE_STOP: 300
% 1.53/1.74 SFINDER_TIME_LIMIT: 2
% 1.53/1.74 SHORT_CLAUSE_CUTOFF: 4
% 1.53/1.74 number of clauses in intial UL: 535
% 1.53/1.74 number of clauses initially in problem: 539
% 1.53/1.74 percentage of clauses intially in UL: 99
% 1.53/1.74 percentage of distinct symbols occuring in initial UL: 100
% 1.53/1.74 percent of all initial clauses that are short: 100
% 1.53/1.74 absolute distinct symbol count: 76
% 1.53/1.74 distinct predicate count: 7
% 1.53/1.74 distinct function count: 64
% 1.53/1.74 distinct constant count: 5
% 1.53/1.74
% 1.53/1.74 ---------- no more Softie stats ----------
% 1.53/1.74
% 1.53/1.74
% 1.53/1.74
% 1.53/1.74 Stopped by limit on insertions
% 1.53/1.74
% 1.53/1.74 =========== start of search ===========
% 13.05/13.24
% 13.05/13.24 -- HEY sandbox2, WE HAVE A PROOF!! --
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 2 [ 4 109 209814 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 3 [ 5 4 4311 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 4 [ 4 106 215943 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 5 [ 4 2 2256 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 6 [ 5 4 4425 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 7 [ 4 8 14005 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 8 [ 4 89 180971 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 9 [ 5 5 10756 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Stopped by limit on insertions
% 13.05/13.24
% 13.05/13.24 Model 10 [ 4 57 142074 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 Modelling stopped after 300 given clauses and 0.00 seconds
% 13.05/13.24
% 13.05/13.24
% 13.05/13.24 ----> UNIT CONFLICT at 12.80 sec ----> 2412 [binary,2411.1,134.1] {-} $F.
% 13.05/13.24
% 13.05/13.24 Length of proof is 15. Level of proof is 15.
% 13.05/13.24
% 13.05/13.24 ---------------- PROOF ----------------
% 13.05/13.24 % SZS status Theorem
% 13.05/13.24 % SZS output start Refutation
% 13.05/13.24
% 13.05/13.24 2 [] {+} -r1($c5,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -r1(D,E)|p4(E).
% 13.05/13.24 48 [] {+} -r1($c5,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|r1(D,$f23(A,B,C,D))|p1(D).
% 13.05/13.24 49 [] {+} -r1($c5,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p4($f23(A,B,C,D))|p1(D).
% 13.05/13.24 70 [] {+} -r1($c5,A)| -r1(A,B)| -r1(B,C)|r1(C,$f34(A,B,C))|p4(C).
% 13.05/13.24 71 [] {+} -r1($c5,A)| -r1(A,B)| -r1(B,C)| -p1($f34(A,B,C))|p4(C).
% 13.05/13.24 112 [] {+} -r1($c5,A)| -r1(A,B)|r1(B,$f55(A,B))|p1(B).
% 13.05/13.24 113 [] {+} -r1($c5,A)| -r1(A,B)| -p4($f55(A,B))|p1(B).
% 13.05/13.24 126 [] {+} -r1($c5,A)|r1(A,$f62(A))|p2(A).
% 13.05/13.24 127 [] {+} -r1($c5,A)| -p1($f62(A))|p2(A).
% 13.05/13.24 134 [] {+} -p2($c3).
% 13.05/13.24 601 [] {-} r1($c5,$c3).
% 13.05/13.24 631 [hyper,601,126,unit_del,134] {-} r1($c3,$f62($c3)).
% 13.05/13.24 676 [hyper,631,112,601] {+} r1($f62($c3),$f55($c3,$f62($c3)))|p1($f62($c3)).
% 13.05/13.24 845 [hyper,676,127,601,unit_del,134] {+} r1($f62($c3),$f55($c3,$f62($c3))).
% 13.05/13.24 866 [hyper,845,70,601,631] {+} r1($f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3))))|p4($f55($c3,$f62($c3))).
% 13.05/13.24 1516 [hyper,866,113,601,631] {+} r1($f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3))))|p1($f62($c3)).
% 13.05/13.24 1517 [hyper,1516,127,601,unit_del,134] {+} r1($f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3)))).
% 13.05/13.24 1520 [hyper,1517,48,601,631,845] {+} r1($f34($c3,$f62($c3),$f55($c3,$f62($c3))),$f23($c3,$f62($c3),$f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3)))))|p1($f34($c3,$f62($c3),$f55($c3,$f62($c3)))).
% 13.05/13.24 2401 [hyper,1520,71,601,631,845] {+} r1($f34($c3,$f62($c3),$f55($c3,$f62($c3))),$f23($c3,$f62($c3),$f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3)))))|p4($f55($c3,$f62($c3))).
% 13.05/13.24 2402 [hyper,2401,113,601,631] {+} r1($f34($c3,$f62($c3),$f55($c3,$f62($c3))),$f23($c3,$f62($c3),$f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3)))))|p1($f62($c3)).
% 13.05/13.24 2403 [hyper,2402,127,601,unit_del,134] {+} r1($f34($c3,$f62($c3),$f55($c3,$f62($c3))),$f23($c3,$f62($c3),$f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3))))).
% 13.05/13.24 2406 [hyper,2403,2,601,631,845,1517] {-} p4($f23($c3,$f62($c3),$f55($c3,$f62($c3)),$f34($c3,$f62($c3),$f55($c3,$f62($c3))))).
% 13.05/13.24 2408 [hyper,2406,49,601,631,845,1517] {-} p1($f34($c3,$f62($c3),$f55($c3,$f62($c3)))).
% 13.05/13.24 2409 [hyper,2408,71,601,631,845] {+} p4($f55($c3,$f62($c3))).
% 13.05/13.24 2410 [hyper,2409,113,601,631] {-} p1($f62($c3)).
% 13.05/13.24 2411 [hyper,2410,127,601] {-} p2($c3).
% 13.05/13.24 2412 [binary,2411.1,134.1] {-} $F.
% 13.05/13.24
% 13.05/13.24 % SZS output end Refutation
% 13.05/13.24 ------------ end of proof -------------
% 13.05/13.24
% 13.05/13.24
% 13.05/13.24 Search stopped by max_proofs option.
% 13.05/13.24
% 13.05/13.24
% 13.05/13.24 Search stopped by max_proofs option.
% 13.05/13.24
% 13.05/13.24 ============ end of search ============
% 13.05/13.24
% 13.05/13.24 ----------- soft-scott stats ----------
% 13.05/13.24
% 13.05/13.24 true clauses given 1091 (78.0%)
% 13.05/13.24 false clauses given 307
% 13.05/13.24
% 13.05/13.24 FALSE TRUE
% 13.05/13.24 17 0 1
% 13.05/13.24 34 0 412
% 13.05/13.24 tot: 0 413 (100.0% true)
% 13.05/13.24
% 13.05/13.24
% 13.05/13.24 Model 10 [ 4 57 142074 ] (0.00 seconds, 250000 Inserts)
% 13.05/13.24
% 13.05/13.24 That finishes the proof of the theorem.
% 13.05/13.24
% 13.05/13.24 Process 32268 finished Sun Jul 3 04:50:08 2022
%------------------------------------------------------------------------------