TSTP Solution File: MGT038-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT038-10 : TPTP v8.1.0. Released v7.5.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 : n028.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 22:10:34 EDT 2022
% Result : Satisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT038-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 08:25:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 3 conjectures.
% 0.12/0.37 # There are 3 start rule candidates:
% 0.12/0.37 # Found 14 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 3 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 14 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 43 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 43 tableaux to operate on
% 0.12/0.37 # 19901 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_26, negated_conjecture, (environment(sk3)=true)).
% 0.12/0.37 cnf(i_0_27, negated_conjecture, (stable(sk3)=true)).
% 0.12/0.37 cnf(i_0_17, plain, (finite_set(first_movers)=true)).
% 0.12/0.37 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_25, hypothesis, (ifeq(environment(X1),true,greater(appear(efficient_producers,e),appear(first_movers,X1)),true)=true)).
% 0.12/0.37 cnf(i_0_24, hypothesis, (ifeq(environment(X1),true,ifeq(stable(X1),true,contracts_from(sk2(X1),first_movers),true),true)=true)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(finite_set(X1),true,ifeq2(contracts_from(X2,X1),true,cardinality_at_time(s,t2),zero),zero)=zero)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq(greater(X1,X2),true,ifeq(greater(X3,X1),true,greater(X3,X2),true),true)=true)).
% 0.12/0.37 cnf(i_0_18, plain, (ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,appear(first_movers,X1)),true),true)=true)).
% 0.12/0.37 cnf(i_0_23, hypothesis, (ifeq(environment(X1),true,ifeq(stable(X1),true,greater(sk2(X1),appear(efficient_producers,X1)),true),true)=true)).
% 0.12/0.37 cnf(i_0_19, plain, (ifeq(finite_set(X1),true,ifeq(contracts_from(X2,X1),true,greater(sk1(X2,X1),X2),true),true)=true)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(greater(X1,X2),true,ifeq(in_environment(X3,X2),true,ifeq(environment(X3),true,ifeq(stable(X3),true,in_environment(X3,X1),true),true),true),true)=true)).
% 0.12/0.37 cnf(i_0_28, negated_conjecture, (tuple(cardinality_at_time(first_movers,to),in_environment(sk3,X1),greater(X1,appear(first_movers,sk3)))!=tuple(zero,true,true))).
% 0.12/0.37 cnf(i_0_32, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_26, negated_conjecture, (environment(sk3)=true), inference(start_rule)).
% 0.12/0.37 cnf(i_0_49, plain, (environment(sk3)=true), inference(extension_rule, [i_0_47])).
% 0.12/0.37 cnf(i_0_105, plain, (sk2(environment(sk3))=sk2(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.37 cnf(i_0_297, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])).
% 0.12/0.37 cnf(i_0_298, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])).
% 0.12/0.37 cnf(i_0_299, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # 19898 Satisfiable branch
% 0.12/0.38 # 19899 Satisfiable branch
% 0.12/0.38 # 19900 Satisfiable branch
% 0.12/0.38 # 19902 Satisfiable branch
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 0 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # Child (19901) has found a proof.
% 0.12/0.38
% 0.12/0.38 # 19903 Satisfiable branch
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------