%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : TOP022+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 : Thu Jul 21 21:34:50 EDT 2022
% Result : Theorem 0.83s 1.05s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : TOP022+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.10 % Command : sos-script %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sun May 29 08:32:41 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.09/0.30 ----- Otter 3.2, August 2001 -----
% 0.09/0.30 The process was started by sandbox on n032.cluster.edu,
% 0.09/0.30 Sun May 29 08:32:41 2022
% 0.09/0.30 The command was "./sos". The process ID is 10127.
% 0.09/0.30
% 0.09/0.30 set(prolog_style_variables).
% 0.09/0.30 set(auto).
% 0.09/0.30 dependent: set(auto1).
% 0.09/0.30 dependent: set(process_input).
% 0.09/0.30 dependent: clear(print_kept).
% 0.09/0.30 dependent: clear(print_new_demod).
% 0.09/0.30 dependent: clear(print_back_demod).
% 0.09/0.30 dependent: clear(print_back_sub).
% 0.09/0.30 dependent: set(control_memory).
% 0.09/0.30 dependent: assign(max_mem, 12000).
% 0.09/0.30 dependent: assign(pick_given_ratio, 4).
% 0.09/0.30 dependent: assign(stats_level, 1).
% 0.09/0.30 dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.30 dependent: assign(sos_limit, 5000).
% 0.09/0.30 dependent: assign(max_weight, 60).
% 0.09/0.30 clear(print_given).
% 0.09/0.30
% 0.09/0.30 formula_list(usable).
% 0.09/0.30
% 0.09/0.30 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.09/0.30
% 0.09/0.30 This is a non-Horn set without equality. The strategy
% 0.09/0.30 will be ordered hyper_res, ur_res, unit deletion, and
% 0.09/0.30 factoring, with satellites in sos and nuclei in usable.
% 0.09/0.30
% 0.09/0.30 dependent: set(hyper_res).
% 0.09/0.30 dependent: set(factor).
% 0.09/0.30 dependent: set(unit_deletion).
% 0.09/0.30
% 0.09/0.30 ------------> process usable:
% 0.09/0.30
% 0.09/0.30 ------------> process sos:
% 0.09/0.30 Following clause subsumed by 8 during input processing: 0 [] {-} path_connected(A)|a_member_of(B,A).
% 0.09/0.30
% 0.09/0.30 ======= end of input processing =======
% 0.13/0.33
% 0.13/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.33
% 0.13/0.33 Stopped by limit on number of solutions
% 0.13/0.33
% 0.13/0.33
% 0.13/0.33 -------------- Softie stats --------------
% 0.13/0.33
% 0.13/0.33 UPDATE_STOP: 300
% 0.13/0.33 SFINDER_TIME_LIMIT: 2
% 0.13/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.33 number of clauses in intial UL: 7
% 0.13/0.33 number of clauses initially in problem: 11
% 0.13/0.33 percentage of clauses intially in UL: 63
% 0.13/0.33 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.33 percent of all initial clauses that are short: 100
% 0.13/0.33 absolute distinct symbol count: 12
% 0.13/0.33 distinct predicate count: 5
% 0.13/0.33 distinct function count: 4
% 0.13/0.33 distinct constant count: 3
% 0.13/0.33
% 0.13/0.33 ---------- no more Softie stats ----------
% 0.13/0.33
% 0.13/0.33
% 0.13/0.33
% 0.13/0.33 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.33
% 0.13/0.33 Stopped by limit on number of solutions
% 0.13/0.33
% 0.13/0.33 =========== start of search ===========
% 0.83/1.05
% 0.83/1.05 -------- PROOF --------
% 0.83/1.05 % SZS status Theorem
% 0.83/1.05 % SZS output start Refutation
% 0.83/1.05
% 0.83/1.05 Stopped by limit on insertions
% 0.83/1.05
% 0.83/1.05 Stopped by limit on insertions
% 0.83/1.05
% 0.83/1.05 Stopped by limit on insertions
% 0.83/1.05
% 0.83/1.05 Model 3 [ 2 1 376 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.05
% 0.83/1.05 Stopped by limit on insertions
% 0.83/1.05
% 0.83/1.05 Stopped by limit on insertions
% 0.83/1.05
% 0.83/1.05 ----> UNIT CONFLICT at 0.72 sec ----> 25 [binary,24.1,6.1] {-} $F.
% 0.83/1.05
% 0.83/1.05 Length of proof is 3. Level of proof is 3.
% 0.83/1.05
% 0.83/1.05 ---------------- PROOF ----------------
% 0.83/1.05 % SZS status Theorem
% 0.83/1.05 % SZS output start Refutation
% 0.83/1.05
% 0.83/1.05 2 [] {+} isomorphic_groups(A,B)| -a_group_isomorphism_from_to(C,A,B).
% 0.83/1.05 3 [] {+} -path_connected(A)| -a_member_of(B,A)| -a_member_of(C,A)|a_path_from_to_in($f2(A,B,C),B,C,A).
% 0.83/1.05 5 [] {+} -a_path_from_to_in(A,B,C,D)|a_group_isomorphism_from_to(alpha_hat(A),first_homotop_grp(D,B),first_homotop_grp(D,C)).
% 0.83/1.05 6 [] {+} -isomorphic_groups(first_homotop_grp($c3,$c2),first_homotop_grp($c3,$c1)).
% 0.83/1.05 9 [] {-} path_connected($c3).
% 0.83/1.05 10 [] {+} a_member_of($c2,$c3).
% 0.83/1.05 11 [] {+} a_member_of($c1,$c3).
% 0.83/1.05 15 [hyper,11,3,9,10] {-} a_path_from_to_in($f2($c3,$c2,$c1),$c2,$c1,$c3).
% 0.83/1.05 20 [hyper,15,5] {-} a_group_isomorphism_from_to(alpha_hat($f2($c3,$c2,$c1)),first_homotop_grp($c3,$c2),first_homotop_grp($c3,$c1)).
% 0.83/1.05 24 [hyper,20,2] {-} isomorphic_groups(first_homotop_grp($c3,$c2),first_homotop_grp($c3,$c1)).
% 0.83/1.05 25 [binary,24.1,6.1] {-} $F.
% 0.83/1.05
% 0.83/1.05 % SZS output end Refutation
% 0.83/1.05 ------------ end of proof -------------
% 0.83/1.05
% 0.83/1.05
% 0.83/1.05 Search stopped by max_proofs option.
% 0.83/1.05
% 0.83/1.05
% 0.83/1.05 Search stopped by max_proofs option.
% 0.83/1.05
% 0.83/1.05 ============ end of search ============
% 0.83/1.05
% 0.83/1.05 ----------- soft-scott stats ----------
% 0.83/1.05
% 0.83/1.05 true clauses given 3 (21.4%)
% 0.83/1.05 false clauses given 11
% 0.83/1.05
% 0.83/1.05 FALSE TRUE
% 0.83/1.05 12 1 0
% 0.83/1.05 14 1 0
% 0.83/1.05 tot: 2 0 (0.0% true)
% 0.83/1.05
% 0.83/1.05
% 0.83/1.05 Model 3 [ 2 -29 376 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.05
% 0.83/1.05 That finishes the proof of the theorem.
% 0.83/1.05
% 0.83/1.05 Process 10127 finished Sun May 29 08:32:42 2022
%------------------------------------------------------------------------------