TSTP Solution File: SET007-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n010.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 : Tue Jul 19 00:56:03 EDT 2022
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 00:29:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 23 Number of unprocessed: 23
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.39 # The folding up rule is enabled...
% 0.13/0.39 # Local unification is enabled...
% 0.13/0.39 # Any saturation attempts will use folding labels...
% 0.13/0.39 # 23 beginning clauses after preprocessing and clausification
% 0.13/0.39 # Creating start rules for all 1 conjectures.
% 0.13/0.39 # There are 1 start rule candidates:
% 0.13/0.39 # Found 5 unit axioms.
% 0.13/0.39 # 1 start rule tableaux created.
% 0.13/0.39 # 18 extension rule candidate clauses
% 0.13/0.39 # 5 unit axiom clauses
% 0.13/0.39
% 0.13/0.39 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.41 # There were 9 total branch saturation attempts.
% 0.13/0.41 # There were 0 of these attempts blocked.
% 0.13/0.41 # There were 0 deferred branch saturation attempts.
% 0.13/0.41 # There were 6 free duplicated saturations.
% 0.13/0.41 # There were 9 total successful branch saturations.
% 0.13/0.41 # There were 0 successful branch saturations in interreduction.
% 0.13/0.41 # There were 0 successful branch saturations on the branch.
% 0.13/0.41 # There were 3 successful branch saturations after the branch.
% 0.13/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 # Begin clausification derivation
% 0.13/0.41
% 0.13/0.41 # End clausification derivation
% 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.41 cnf(i_0_42, plain, (union(b,c,bUc))).
% 0.13/0.41 cnf(i_0_43, plain, (intersection(a,b,aIb))).
% 0.13/0.41 cnf(i_0_44, plain, (intersection(a,c,aIc))).
% 0.13/0.41 cnf(i_0_45, plain, (intersection(a,bUc,aI_bUc))).
% 0.13/0.41 cnf(i_0_46, negated_conjecture, (~union(aIb,aIc,aI_bUc))).
% 0.13/0.41 cnf(i_0_28, plain, (subset(X1,X2)|~equal_sets(X2,X1))).
% 0.13/0.41 cnf(i_0_27, plain, (subset(X1,X2)|~equal_sets(X1,X2))).
% 0.13/0.41 cnf(i_0_26, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))).
% 0.13/0.41 cnf(i_0_29, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))).
% 0.13/0.41 cnf(i_0_24, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))).
% 0.13/0.41 cnf(i_0_32, plain, (member(X1,X2)|~union(X3,X4,X2)|~member(X1,X4))).
% 0.13/0.41 cnf(i_0_25, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))).
% 0.13/0.41 cnf(i_0_31, plain, (member(X1,X2)|~union(X3,X4,X2)|~member(X1,X3))).
% 0.13/0.41 cnf(i_0_37, plain, (member(X1,X2)|~intersection(X3,X2,X4)|~member(X1,X4))).
% 0.13/0.41 cnf(i_0_36, plain, (member(X1,X2)|~intersection(X2,X3,X4)|~member(X1,X4))).
% 0.13/0.41 cnf(i_0_38, plain, (member(X1,X2)|~intersection(X3,X4,X2)|~member(X1,X4)|~member(X1,X3))).
% 0.13/0.41 cnf(i_0_30, plain, (member(X1,X2)|member(X1,X3)|~union(X2,X3,X4)|~member(X1,X4))).
% 0.13/0.41 cnf(i_0_35, plain, (union(X1,X2,X3)|~member(g(X1,X2,X3),X3)|~member(g(X1,X2,X3),X2))).
% 0.13/0.41 cnf(i_0_34, plain, (union(X1,X2,X3)|~member(g(X1,X2,X3),X3)|~member(g(X1,X2,X3),X1))).
% 0.13/0.41 cnf(i_0_41, plain, (intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1))).
% 0.13/0.41 cnf(i_0_40, plain, (intersection(X1,X2,X3)|member(h(X1,X2,X3),X2)|member(h(X1,X2,X3),X3))).
% 0.13/0.41 cnf(i_0_39, plain, (intersection(X1,X2,X3)|member(h(X1,X2,X3),X1)|member(h(X1,X2,X3),X3))).
% 0.13/0.41 cnf(i_0_33, plain, (union(X1,X2,X3)|member(g(X1,X2,X3),X1)|member(g(X1,X2,X3),X2)|member(g(X1,X2,X3),X3))).
% 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.41 # Begin printing tableau
% 0.13/0.41 # Found 7 steps
% 0.13/0.41 cnf(i_0_46, negated_conjecture, (~union(aIb,aIc,aI_bUc)), inference(start_rule)).
% 0.13/0.41 cnf(i_0_47, plain, (~union(aIb,aIc,aI_bUc)), inference(extension_rule, [i_0_33])).
% 0.13/0.41 cnf(i_0_99, plain, (member(g(aIb,aIc,aI_bUc),aIb)), inference(extension_rule, [i_0_37])).
% 0.13/0.41 cnf(i_0_592, plain, (~intersection(a,b,aIb)), inference(closure_rule, [i_0_43])).
% 0.13/0.41 cnf(i_0_100, plain, (member(g(aIb,aIc,aI_bUc),aIc)), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.13/0.41 cnf(i_0_101, plain, (member(g(aIb,aIc,aI_bUc),aI_bUc)), inference(etableau_closure_rule, [i_0_101, ...])).
% 0.13/0.41 cnf(i_0_591, plain, (member(g(aIb,aIc,aI_bUc),b)), inference(etableau_closure_rule, [i_0_591, ...])).
% 0.13/0.41 # End printing tableau
% 0.13/0.41 # SZS output end
% 0.13/0.41 # Branches closed with saturation will be marked with an "s"
% 0.13/0.41 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.41 # We now have 6 tableaux to operate on
% 0.13/0.41 # Found closed tableau during pool population.
% 0.13/0.41 # Proof search is over...
% 0.13/0.41 # Freeing feature tree
%------------------------------------------------------------------------------